132 results found
Sergot M, 2021, Some Forms of Collectively Bringing About or 'Seeing to it that', JOURNAL OF PHILOSOPHICAL LOGIC, Vol: 50, Pages: 249-283, ISSN: 0022-3611
Kulicki P, Trypuz R, Sergot M, 2020, Who is obliged when many are involved? Labelled transition system modelling of how obligation arises, ARTIFICIAL INTELLIGENCE AND LAW, Vol: 29, Pages: 395-415, ISSN: 0924-8463
Evans R, Sergot M, Stephenson A, 2020, Formalizing Kant's Rules A Logic of Conditional Imperatives and Permissives, JOURNAL OF PHILOSOPHICAL LOGIC, Vol: 49, Pages: 613-680, ISSN: 0022-3611
Evans R, Hernández-Orallo J, Welbl J, et al., 2020, Evaluating the Apperception Engine., CoRR, Vol: abs/2007.05367
Artikis A, Sergot M, Paliouras G, 2015, An Event Calculus for Event Recognition, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, Vol: 27, Pages: 895-908, ISSN: 1041-4347
Artikis A, Sergot MJ, Paliouras G, 2015, Reactive Reasoning with the Event Calculus., CoRR, Vol: abs/1505.05364
Sergot M, 2014, Some Examples Formulated in a 'Seeing to It That' Logic: Illustrations, Observations, Problems, Editors: Muller, Publisher: SPRINGER INT PUBLISHING AG, Pages: 223-256, ISBN: 978-3-319-01753-2
Bin Goh WW, Sergot MJ, Sng JCG, et al., 2013, "Comparative Network-Based Recovery Analysis and Proteomic Profiling of Neurological Changes in Valproic AcidTreated Mice" (vol 12, pg 2116, 2013), JOURNAL OF PROTEOME RESEARCH, Vol: 12, Pages: 4650-4650, ISSN: 1535-3893
Goh WW, Sergot MJ, Sng JC, et al., 2013, Correction to "Comparative Network-Based Recovery Analysis and Proteomic Profiling of Neurological Changes in Valproic Acid-Treated Mice", J Proteome Res
Bin Goh WW, Sergot MJ, Sng JC, et al., 2013, Comparative Network-Based Recovery Analysis and Proteomic Profiling of Neurological Changes in Valproic Acid-Treated Mice, JOURNAL OF PROTEOME RESEARCH, Vol: 12, Pages: 2116-2127, ISSN: 1535-3893
Artikis A, Sergot M, Paliouras G, 2013, A logic-based approach to activity recognition, Human Behavior Recognition Technologies: Intelligent Applications for Monitoring and Security, Pages: 1-13, ISBN: 9781466636828
The authors have been developing a system for recognising human activities given a symbolic representation of video content. The input of the system is a stream of time-stamped short-term activities detected on video frames. The output of the system is a set of recognised long-term activities, which are pre-defined spatio-temporal combinations of short-term activities. The constraints on the short-term activities that, if satisfied, lead to the recognition of a long-term activity, are expressed using a dialect of the Event Calculus. The authors illustrate the expressiveness of the dialect by showing the representation of several typical complex activities. Furthermore, they present a detailed evaluation of the system through experimentation on a benchmark dataset of surveillance videos.
Bin Goh WW, Fan M, Low HS, et al., 2013, Enhancing the utility of Proteomics Signature Profiling (PSP) with Pathway Derived Subnets (PDSs), performance analysis and specialised ontologies, BMC GENOMICS, Vol: 14, ISSN: 1471-2164
Schulz C, Sergot M, Toni F, 2013, Argumentation-based answer set justification
We suggest a method for justifying why a literal is or is notcontained in the answer set of a logic program. This methodmakes use of argumentation theory, more precisely of stableASPIC+ extensions. We describe a way to translate a logicprogram into an ASPIC+ argumentation theory and investigate the relation between answer sets of the logic programand stable extensions of the translated ASPIC+ argumentation theory. The structure of ASPIC+ arguments with respectto a stable extension is then used for the justification of literalswith respect to an answer set. We also present an implementation of our justification method which displays justificationsas graphs.
Artikis A, Sergot M, Paliouras G, 2012, Run-time composite event recognition, Pages: 69-80
Events are particularly important pieces of knowledge, as they represent activities of special significance within an organisation: the automated recognition of events is of utmost importance. We present RTEC, an Event Calculus dialect for run-time event recognition and its Prolog implementation. RTEC includes a number of novel techniques allowing for efficient run-time recognition, scalable to large data streams. It can be used in applications where data might arrive with a delay from, or might be revised by, the underlying event sources. We evaluate RTEC using a real-world application. Copyright © 2012 ACM.
Bin Goh WW, Lee YH, Ramdzan ZM, et al., 2012, Proteomics Signature Profiling (PSP): A Novel Contextualization Approach for Cancer Proteomics, JOURNAL OF PROTEOME RESEARCH, Vol: 11, Pages: 1571-1581, ISSN: 1535-3893
Bin Goh WW, Oikawa H, Sng JCG, et al., 2012, The role of miRNAs in complex formation and control, BIOINFORMATICS, Vol: 28, Pages: 453-456, ISSN: 1367-4803
Goh WWB, Lee YH, Ramdzan ZM, et al., 2012, A network-based maximum link approach towards MS identifies potentially important roles for undetected ARRB1/2 and ACTB in liver cancer progression., Int J Bioinform Res Appl, Vol: 8, Pages: 155-170, ISSN: 1744-5485
Hepatocellular Carcinoma (HCC) ranks among the deadliest of cancers and has a complex etiology. Proteomics analysis using iTRAQ provides a direct way to analyse perturbations in protein expression during HCC progression from early- to late-stage but suffers from consistency and coverage issues. Appropriate use of network-based analytical methods can help to overcome these issues. We built an integrated and comprehensive Protein-Protein Interaction Network (PPIN) by merging several major databases. Additionally, the network was filtered for GO coherent edges. Significantly differential genes (seeds) were selected from iTRAQ data and mapped onto this network. Undetected proteins linked to seeds (linked proteins) were identified and functionally characterised. The process of network cleaning provides a list of higher quality linked proteins, which are highly enriched for similar biological process gene ontology terms. Linked proteins are also enriched for known cancer genes and are linked to many well-established cancer processes such as apoptosis and immune response. We found that there is an increased propensity for known cancer genes to be found in highly linked proteins. Three highly-linked proteins were identified that may play an important role in driving HCC progression - the G-protein coupled receptor signalling proteins, ARRB1/2 and the structural protein beta-actin, ACTB. Interestingly, both ARRB proteins evaded detection in the iTRAQ screen. ACTB was not detected in the original dataset derived from Mascot but was found to be strongly supported when we re-ran analysis using another protein detection database (Paragon). Identification of linked proteins helps to partially overcome the coverage issue in shotgun proteomics analysis. The set of linked proteins are found to be enriched for cancer-specific processes, and more likely so if they are more highly linked. Additionally, a higher quality linked set is derived if network-cleaning is performed prior. This
Toni F, Sergot M, 2011, Argumentation and answer set programming, Pages: 164-180, ISBN: 9783642208317
Argumentation and answer set programming are two of the main knowledge representation paradigms that have emerged from logic programming for non-monotonic reasoning. This paper surveys recent work on using answer set programming as a mechanism for computing extensions in argumentation. The paper also indicates some possible directions for future work. © 2011 Springer-Verlag Berlin Heidelberg.
Artikis A, Sergot M, Paliouras G, 2010, A logic programming approach to activity recognition, Pages: 3-8
We have been developing a system for recognising human activity given a symbolic representation of video content. The input of our system is a set of time-stamped short-term activities detected on video frames. The output of our system is a set of recognised long-term activities, which are pre-defined temporal combinations of short-term activities. The constraints on the short-term activities that, if satisfied, lead to the recognition of a long-term activity, are expressed using a dialect of the Event Calculus. We illustrate the expressiveness of the dialect by showing the representation of several typical complex activities. Furthermore, we present a detailed evaluation of the system through experimentation on a benchmark dataset of surveillance videos.
Artikis A, Sergot M, 2010, Executable specification of open multi-agent systems, LOGIC JOURNAL OF THE IGPL, Vol: 18, Pages: 31-65, ISSN: 1367-0751
Sergot M, 2010, Norms, Action and Agency in Multi-agent Systems, 10th International Conference on Deontic Logic in Computer Science, Publisher: SPRINGER-VERLAG BERLIN, Pages: 2-2, ISSN: 0302-9743
Artikis A, Sergot M, Pitt J, 2009, Specifying Norm-Governed Computational Societies, ACM Transactions on Computational Logic, Vol: 10, Pages: 1-42
Barker S, Sergot MJ, Wijesekera D, 2008, Status-Based Access Control, ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, Vol: 12, ISSN: 1094-9224
Craven R, Sergot MJ, 2008, Agent strands in the action language nC+., Journal of Applied Logic, Vol: 6, Pages: 172-191, ISSN: 1570-8683
Sergot M, 2008, Action and Agency in Norm-Governed Multi-agent Systems, 8th International Workshop on Engineering Societies in the Agents World, Publisher: SPRINGER-VERLAG BERLIN, Pages: 1-54, ISSN: 0302-9743
Artikis A, Sergot M, Pitt JV, 2007, An Executable Specification of a Formal Argumentation Protocol, Artificial Intelligence Journal, Vol: 171, Pages: 776-804
We present a specification, in the action language C+, of Brewka's reconstruction of a theory of formal disputation originally proposed by Rescher. The focus is on the procedural aspects rather than the adequacy of this particular protocol for the conduct of debate and the resolution of disputes. The specification is structured in three separate levels, covering (i) the physical capabilities of the participant agents, (ii) the rules defining the protocol itself, specifying which actions are ‘proper’ and ‘timely’ according to the protocol and their effects on the protocol state, and (iii) the permissions, prohibitions, and obligations of the agents, and the sanctions and enforcement strategies that deal with non-compliance. Also included is a mechanism by which an agent may object to an action by another participant, and an optional ‘silence implies consent’ principle. Although comparatively simple, Brewka's protocol is thus representative of a wide range of other more complex argumentation and dispute resolution procedures that have been proposed. Finally, we show how the ‘Causal Calculator’ implementation of C+ can be used to animate the specification and to investigate and verify properties of the protocol.
Farrell ADH, Sergot MJ, 2007, Formalising workflow: A CCS-inspired characterisation of the YAWL workflow patterns, 11th FMEC Workshop 2005, Publisher: SPRINGER, Pages: 213-254, ISSN: 0926-2644
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.