Publications
135 results found
Dell'Acqua P, Sadri F, Toni F, 1998, Combining introspection and communication with rationality and reactivity in agents, European Workshop on Logics in Artificial Intelligence (JELIA 99), Publisher: SPRINGER-VERLAG BERLIN, Pages: 17-32, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 8
Kowalski RA, Sadri F, Toni F, 1998, An agent architecture that combines backward and forward reasoning, Proceedings CADE-15 Workshop on Strategies in Automated Deduction, Pages: 49-56
Kowalski RA, Sadri F, Toni F, 1998, An agent architecture that combines backward and forward reasoning, Proceedings CADE-15 Workshop on Strategies in Automated Deduction, Pages: 49-56
Kowalski R, Sadri F, 1997, Reconciling the event calculus with the situation calculus, JOURNAL OF LOGIC PROGRAMMING, Vol: 31, Pages: 39-58, ISSN: 0743-1066
- Author Web Link
- Cite
- Citations: 28
Kowalski R, Sadri F, 1997, Reconciling the event calculus with the situation calculus, Journal of Logic Programming, Vol: 31, ISSN: 0743-1066
In this paper, to compare the situation calculus and event calculus we formulate both as logic programs and prove properties of these by reasoning with their completions augmented with induction. We thus show that the situation calculus and event calculus imply one another. Whereas our derivation of the event calculus from the situation calculus requires the use of induction, our derivation of the situation calculus from the event calculus does not. We also show that in certain concrete applications, such as the missing car example, conclusions that seem to require the use of induction in the situation calculus can be derived without induction in the event calculus. To compare the two calculi, we need to make a number of small modifications to both. As a by-product of these modifications, the resulting calculi can be used to reason about both actual and hypothetical states of affairs, including counterfactual ones. We further show how the core axioms of both calculi can be extended to deal with domain or state constraints and certain types of ramifications. We illustrate this by examples from legislation and the blocks world. © Elsevier Science Inc., 1997.
Kowalski RA, Sadri F, 1997, Reconciling the Situation Calculus and Event Calculus, Journal of Logic Programming, Vol: 31, Pages: 39-58
Kowalski RA, Sadri F, 1997, Reconciling the Situation Calculus and Event Calculus, Journal of Logic Programming, Vol: 31, Pages: 39-58
Kowalski RA, Sadri F, 1996, Towards a unified agent architecture that combines rationality with reactivity, Proceedings International Workshop on Logic in Databases, San Miniato, Italy, Publisher: Springer-Verlag
Kowalski RA, Sadri F, 1996, Towards a unified agent architecture that combines rationality with reactivity, Proceedings International Workshop on Logic in Databases, San Miniato, Italy, Publisher: Springer-Verlag
Sadri F, Kowalski RA, 1995, Variants of the event calculus, Proceedings of the International Conference on Logic Programming, Kanagawa, Japan, Publisher: MIT Press, Pages: 67-81
Sadri F, Kowalski RA, 1995, Variants of the event calculus, Proceedings of the International Conference on Logic Programming, Kanagawa, Japan, Publisher: MIT Press, Pages: 67-81
KOWALSKI R, SADRI F, 1994, THE SITUATION CALCULUS AND EVENT CALCULUS COMPARED, 1994 International Logic Programming Symposium (ILPS 94), Publisher: M I T PRESS, Pages: 539-553, ISSN: 1061-0464
- Author Web Link
- Cite
- Citations: 16
Kowalski RA, Sadri F, 1991, Logic programs with exceptions, New Generation Computing, Vol: 9, Pages: 387-400, ISSN: 0288-3635
We extend logic programming to deal with default reasoning by allowing the explicit representation of exceptions in addition to general rules. To formalise this extension, we modify the answer set semantics of Gelfond and Lifschitz, which allows both classical negation and negation as failure. We also propose a transformation which eliminates exceptions by using negation by failure. The transformed program can be implemented by standard logic programming methods, such as SLDNF. The explicit representation of rules and exceptions has the virtue of greater naturalness of expression. The transformed program, however, is easier to implement. © 1991 Ohmsha, Ltd. and Springer.
SERGOT MJ, SADRI F, KOWALSKI RA, et al., 1986, THE BRITISH NATIONALITY ACT AS A LOGIC PROGRAM, COMMUNICATIONS OF THE ACM, Vol: 29, Pages: 370-386, ISSN: 0001-0782
- Author Web Link
- Cite
- Citations: 182
Sereot M, Cory T, Hammond P, et al., 1986, Formalisation of the British Nationality Act, International Review of Law, Computers & Technology, Vol: 2, Pages: 40-52, ISSN: 1360-0869
- Cite
- Citations: 10
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.