Publications
145 results found
Sergot M, 2002, Bob Kowalski: a portrait, Computational logic: logic programming and beyond: essays in honour of Robert A. Kowalski, Part I, Editors: Kakas, Sadri, Publisher: Springer, Pages: 5-25, ISBN: 9783540439592
Sergot M, Richards F, 2001, On the representation of action and agency in the theory of normative positions, 5th International Workshop on Deontic Logic in Computer Science (DEON 00), Publisher: IOS PRESS, Pages: 273-293, ISSN: 0169-2968
- Author Web Link
- Cite
- Citations: 6
Smedley D, Bardien-Kruger S, Huntley D, et al., 2001, Annotating draft human genome sequence to aid susceptibility gene discovery in type 2 diabetes, DIABETOLOGIA, Vol: 44, Pages: A85-A85, ISSN: 0012-186X
Daskalopulu A, Sergot MJ, 2001, A Constraint-Driven System for Contract Assembly
Sergot M, 2001, A computational theory of normative positions, ACM Transactions on Computational Logic, Vol: 2, Pages: 581-622, ISSN: 1529-3785
Lomuscio A, Sergot M, 2000, Investigations in grounded semantics for multi-agent systems specification via deontic logic, Departmental Technical Report: 2000/9, Publisher: Department of Computing, Imperial College London
We investigate an extension of the formalism of interpreted systems by Halpern and colleagues to model correct behaviour of agents. The semantical model allows for the representation and reasoning about states of correct and incorrect function-ing behaviour of the agents, and of the system as a whole. We axiomatise this semantic class by mapping it into a suitable class of Kripke models. The resulting logic is a stronger version of KD, the system often referred to as Standard Deontic Logic. We discuss these issues and present further directions of work related to epistemic logic.
Firozabadi BS, Sergot M, 2000, Power and permission in security systems, 7th International Workshop on Security Protocols, Publisher: SPRINGER-VERLAG BERLIN, Pages: 48-53, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 2
Stathis K, Sergot M, 1998, An abstract framework for globalising interactive systems, INTERACTING WITH COMPUTERS, Vol: 9, Pages: 401-416, ISSN: 0953-5438
- Author Web Link
- Cite
- Citations: 1
Sergot MJ, 1998, A method for automating the analysis of normative positions, Proc. Fourth Int. Workshop on Deontic Logic in Computer Science, Bologna
Sergot MJ, 1998, Normative Positions, Frontiers in Artificial Intelligence and Applications, Publisher: IOS Press
Jones AJI, Sergot MJ, 1997, A Formal Characterisation of Institutionalised Power, Journal of the IGPL, Vol: 4, Pages: 429-445
Daskalopulu A, Sergot M, 1997, The representation of legal contracts, AI & Society, Vol: 11, Pages: 6-17, ISSN: 0951-5666
Stathis K, Sergot M, 1997, Knowledge-based front-ends as games, Failure and Lessons Learned in Information Technology Management, Vol: 1, Pages: 135-147, ISSN: 1088-128X
We present a framework for building complex interactive systems from simple components, with particular attention to the development of knowledge-based front-ends to software packages. The work is motivated from problems with the interactions of GLIMPSE and FAST, two knowledge-based front-ends developed using logic programming tools and techniques. To avoid the pitfalls of GLIMPSE and FAST but to keep their characteristic features, we view interaction as a rule-governed activity that may be usefully regarded as a game. Given a specification of the rules, implementation of the knowledge-based front-end requires the construction of an umpire, a component that enforces compliance of the players with the rules and thereby controls the interaction. Advice-giving components added to the system are analogous to games played in the presence of an advisor who recommends moves to the participants. We also investigate how to customize existing games by studying how to expand and filter their moves. More generally, we examine how to develop compound games built up from subgames; coordination of moves chosen from subgames is then a key issue. This is resolved by treating subgames as active components that communicate the results of interactions from subgames to more complex games illustrated by examples from LAST, a reconstruction of the GLIMPSE and FAST systems in the game-playing framework. Copyright © 1997 Cognizant Comm. Corp. All rights reserved.
Prakken H, Sergot MJ, 1997, Dyadic Deontic Logics and Contrary-to-duty Obligations, Defeasible Deontic Logic: Essays in Nonmonotonic Normative Reasoning, Publisher: Kluwer, Pages: 223-262
Daskalopulu A, Sergot MJ, 1997, The representation of legal contracts, AI and Society, Vol: 11, Pages: 6-17
Hammond P, Sergot M, Wyatt J, 1996, Safety reasoning in medical decision support, IEE Colloquium (Digest), ISSN: 0963-3308
Kesim FN, Sergot MJ, 1996, A Logic Programming Framework for Modelling Temporal Objects, Ieee Transactions on Knowledge and Data Engineering, Vol: 8, Pages: 724-741
Hammond P, Sergot M, 1996, Computer support for protocol-based treatment of cancer, 2nd International Conference on Practical Applications of Prolog (PAP 94), Publisher: ELSEVIER SCIENCE INC, Pages: 93-111, ISSN: 0743-1066
- Author Web Link
- Open Access Link
- Cite
- Citations: 10
Prakken H, Sergot M, 1996, Contrary-to-duty Obligations, Studia Logica, Vol: 57, Pages: 91-115, ISSN: 0039-3215
We investigate under what conditions contrary-to-duty (CTD) structures lacking temporal and action elements can be given a coherent reading. We argue, contrary to some recent proposals, that CTD is not an instance of defeasible reasoning, and that methods of nonmonotonic logics are inadequate since they are unable to distinguish between defeasibility and violation of primary obligations. We propose a semantic framework based on the idea that primary and CTD obligations are obligations of different kinds: a CTD obligation pertains to, 01 pre-supposes, a certain context in which a primary obligation is already violated. This framework is presented initially as an extension of Standard Deontic Logic (SDL), a normal modal logic of type KD, and is illustrated by application to a series of examples. The concluding section is concerned with some resemblances between CTD and defeasible reasoning. We show first that the SDL-based framework contains a flaw and must be adjusted. A discussion of possible adjustments, including an alternative treatment in terms of a preference-based semantics, reveals difficulties that are reminiscent of problems in defeasible reasoning and intensional accounts of defeasible conditionals. © 1996 Kluwer Academic Publishers.
JONES AJI, SERGOT M, 1996, A Formal Characterisation of Institutionalised Power, Publisher: Oxford University Press (OUP), Pages: 427-443, ISSN: 1367-0751
Stathis K, Sergot MJ, 1996, Games as a Metaphor for Interactive Systems, People and Computers XI (Proc. HCI'96, London, August), Publisher: Springer-Verlag, Pages: 19-33
Hammond P, Sergot MJ, 1996, Reusing Formal Models of Safety Knowledge, Proc. SCAMC
Dryllerakis KJ, Sergot MJ, 1996, Representing Systems of Interacting Components in EUCLID, Proc. Math. & AI '96, Florida
Kesim FN, Sergot MJ, 1996, Implementing an Object-oriented Deductive Database using Temporal Reasoning, J.of Database Management, Vol: 7
Prakken H, Sergot MJ, 1996, Contrary-to-duty Obligations, Studia Logica, Vol: 57, Pages: 97-115
Stathis K, Sergot MJ, 1996, A Fast Glimpse of Knowledge-Based Front-Ends as Games, Proc. International Conference on Knowledge-Based Systems in Real-World Applications, Bangkok
SERGOT M, 1995, CONTRIBUTIONS OF FGCS TECHNOLOGY TO APPLICATIONS IN LEGAL REASONING, FUTURE GENERATION COMPUTER SYSTEMS, Vol: 11, Pages: 329-343, ISSN: 0167-739X
Jones AJI, Sergot MJ, 1995, On the role of deontic logic in the characterisation of normative systems, Informatics and the Foundations of Legal Reasoning, Editors: Bankowski, White, Publisher: Kluwer, Pages: 271-289
Kesim FN, Sergot MJ, 1995, Schema Evolution in a Deductive Framework, Proc. First International Workshop on Temporal Reasoning in Deductive and Object-Oriented Databases, Fourth International Conference on Deductive and Object-oriented Databases (DOOD'95), Singapore
Hammond P, Sergot MJ, Wyatt JC, 1995, Formalisation of safety reasoning in protocols and hazard regulations., Proc Annu Symp Comput Appl Med Care, Pages: 253-257, ISSN: 0195-4210
Written protocols are often employed to guide patient care. For treatment within a clinical trial, compliance with the trial protocol may be critical in ensuring efficacy and safety. Previous empirical work has established generic safety principles for reasoning about adverse events in clinical trials and their formalisation has been applied in a decision support system for managing treatment plans in oncology. The same generic knowledge can be reused to generate specific safety clauses when designing new treatment plans. Typically, clinicians devise trial protocols relatively infrequently and so software aids, especially those assisting with regulatory/safety conformance, will encourage more effective use of their time. A similar approach to the formalisation of safety knowledge in the control of hazardous industrial processes is discussed.
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.