Chapter 17 Event Calculus

Foundations of Artificial Intelligence

Volumn 3, Issue , 2008, Pages 671-708

  Mueller, Erik T ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849137937     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(07)03017-9     Document Type: Review

References (115)

1. Akman V., Erdogan S.T., Lee J., Lifschitz V., and Turner H. Representing the zoo world and the traffic world in the language of the causal calculator. Artificial Intelligence 153 (2004) 105-140
2. Baker A.B. Nonmonotonic reasoning in the framework of situation calculus. Artificial Intelligence 49 1-3 (1991) 5-23
3. Baral C. Knowledge Representation, Reasoning and Declarative Problem Solving (2003), Cambridge University Press, Cambridge
4. Bennett B., and Galton A.P. A unifying semantics for time and events. Artificial Intelligence 153 1-2 (2004) 13-48
5. Bobrow D.G. Editor's preface. Artificial Intelligence 13 1-2 (1980) (Special issue on Non-monotonic Reasoning)
6. A. Bracciali and A.C. Kakas. Frame consistency: Computing with causal explanations. In J.P. Delgrande and T. Schaub, editors, Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning, pages 79-87. Whistler, Canada, 2004
7. Brewka G., Dix J., and Konolige K. Nonmonotonic Reasoning: An Overview (1997), CSLI, Stanford, CA
8. F.M. Brown, editor. The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop, Los Altos, CA, 1987. Morgan Kaufmann
9. Cervesato I., Franceschet M., and Montanari A. A guided tour through some extensions of the event calculus. Computational Intelligence 16 2 (2000) 307-347
10. Cicekli N.K., and Yildirim Y. Formalizing workflows using the event calculus. In: Ibrahim M.T., Küng J., and Revell N. (Eds). Database and Expert Systems Applications. Lecture Notes in Computer Science vol. 1873 (2000), Springer, Berlin 222-231
11. Clark K.L. Negation as failure. In: Gallaire H., and Minker J. (Eds). Logic and Data Bases (1978), Plenum, New York 293-322
12. M. Denecker, L. Missiaen, and M. Bruynooghe. Temporal reasoning with abductive event calculus. In B. Neumann, editor, Proceedings of the Tenth European Conference on Artificial Intelligence, pages 384-388, Chichester, UK, 1992. John Wiley
13. Dimopoulos Y., Kakas A.C., and Michael L. Reasoning about actions and change in answer set programming. In: Lifschitz V., and Niemelä I. (Eds). Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science vol. 2923 (2004), Springer, Berlin 61-73
14. P. Doherty. Reasoning about action and change using occlusion. In A.G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence, pages 401-405, Chichester, UK, 1994. John Wiley
15. Doherty P., and Łukaszewicz W. Circumscribing features and fluents. In: Gabbay D.M., and Ohlbach H.J. (Eds). Temporal Logic. Lecture Notes in Computer Science vol. 827 (1994), Springer, Berlin 82-100
16. Doherty P., Łukaszewicz W., and Szałas A. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning 18 3 (1997) 297-336
17. Eshghi K. Abductive planning with event calculus. In: Kowalski R.A., and Bowen K.A. (Eds). Logic Programming: Proceedings of the Fifth International Conference and Symposium vol. 1 (1988), MIT Press, Cambridge, MA 562-579
18. Farrell A.D.H., Sergot M.J., Sallé M., and Bartolini C. Using the event calculus for tracking the normative state of contracts. International Journal of Cooperative Information Systems 14 2-3 (2005) 99-129
19. J.J. Finger. Exploiting constraints in design synthesis. PhD thesis, Department of Computer Science, Stanford University, Stanford, CA, 1987
20. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. In: Kowalski R.A., and Bowen K.A. (Eds). Logic Programming: Proceedings of the Fifth International Conference and Symposium vol. 2 (1988), MIT Press, Cambridge, MA 1070-1080
21. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 3-4 (1991) 365-386
22. Gelfond M., and Lifschitz V. Representing action and change by logic programs. Journal of Logic Programming 17 2-4 (1993) 301-321
23. Genesereth M.R., and Nilsson N.J. Logical Foundations of Artificial Intelligence (1987), Morgan Kaufmann, Palo Alto, CA
24. Ginsberg M.L., and Smith D.E. Reasoning about action I: A possible worlds approach. Artificial Intelligence 35 2 (1988) 165-195
25. Giunchiglia E., Lee J., Lifschitz V., McCain N.C., and Turner H. Nonmonotonic causal theories. Artificial Intelligence 153 (2004) 49-104
26. E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Conference on Innovative Applications of Artificial Intelligence, pages 623-630, Menlo Park, CA, 1998. AAAI Press
27. E. Giunchiglia and R. Sebastiani. Applying the Davis-Putnam procedure to non-clausal formulas. In Proceedings of the Sixth Congress of the Italian Association for Artificial Intelligence, Bologna, 1999
28. B. Grosof. Default reasoning as circumscription: A translation of default logic into circumscription or maximizing defaults is minimizing predicates. In Proceedings of the Non-Monotonic Reasoning Workshop, pages 115-124, Menlo Park, CA, 1984. AAAI Press
29. J. Gustafsson and P. Doherty. Embracing occlusion in specifying the indirect effects of actions. In L.C. Aiello, J. Doyle, and S.C. Shapiro, editors, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, pages 87-98, San Francisco, 1996. Morgan Kaufmann
30. A.R. Haas. The case for domain-specific frame axioms. In F.M. Brown, editor, The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop, pages 343-348, Los Altos, CA, 1987. Morgan Kaufmann
31. H. Halpin, J.D. Moore, and J. Robertson. Automatic analysis of plot for story rewriting. In D. Lin and D. Wu, editors, Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing, pages 127-133, Barcelona, Spain, 2004
32. Hanks S., and McDermott D.V. Nonmonotonic logic and temporal projection. Artificial Intelligence 33 3 (1987) 379-412
33. A.C. Kakas and L. Michael. Modeling complex domains of actions and change. In S. Benferhat and E. Giunchiglia, editors, Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning, pages 380-390, Toulouse, France, 2002
34. A.C. Kakas, L. Michael, and R. Miller. Modular-E: an elaboration tolerant approach to the ramification and qualification problems. In S. McIlraith, P. Peppas, and M. Thielscher, editors, Seventh International Symposium on Logical Formalizations of Commonsense Reasoning, Corfu, Greece, 2005
35. Kakas A.C., and Miller R. Reasoning about actions, narratives and ramifications. Linköping Electronic Articles in Computer and Information Science 2 012 (1997)
36. Kakas A.C., and Miller R. A simple declarative language for describing narratives with actions. Journal of Logic Programming 31 1-3 (1997) 157-200
37. Kakas A.C., Miller R., and Toni F. An argumentation framework for reasoning about actions and change. In: Gelfond M., Leone N., and Pfeifer G. (Eds). Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science vol. 1730 (1999), Springer, Berlin 78-91
38. A.C. Kakas, R. Miller, and F. Toni. E-RES-A system for reasoning about actions, events and observations. In C. Baral and M. Truszczynski, editors, Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning, Breckenridge, CO, 2000
39. Kowalski R.A. Logic for Problem Solving (1979), North-Holland, New York
40. R.A. Kowalski. Database updates in the event calculus. Technical Report DOC 86/12, London: Imperial College of Science, Technology, and Medicine, 1986
41. Kowalski R.A. Database updates in the event calculus. Journal of Logic Programming 12 (1992) 121-146
42. Kowalski R.A. Legislation as logic programs. In: Comyn G., Fuchs N.E., and Ratcliffe M. (Eds). Logic Programming in Action, Second International Logic Programming Summer School. Lecture Notes in Computer Science vol. 636 (1992), Springer, Berlin 203-230
43. Kowalski R.A., and Sadri F. The situation calculus and event calculus compared. In: Bruynooghe M. (Ed). Logic Programming: The 1994 International Symposium (1994), MIT Press, Cambridge, MA 539-553
44. Kowalski R.A., and Sadri F. Reconciling the event calculus with the situation calculus. Journal of Logic Programming 31 1-3 (1997) 39-58
45. Kowalski R.A., and Sergot M.J. A logic-based calculus of events. New Generation Computing 4 1 (1986) 67-95
46. F. Lévy and J.J. Quantz. Representing beliefs in a situated event calculus. In H. Prade, editor, Proceedings of the Thirteenth European Conference on Artificial Intelligence, pages 547-551, Chichester, UK, 1998. John Wiley
47. V. Lifschitz. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 121-127, Los Altos, CA, 1985. Morgan Kaufmann
48. V. Lifschitz. Formal theories of action. In F.M. Brown, editor, The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop, pages 35-57, Los Altos, CA, 1987. Morgan Kaufmann
49. Lifschitz V. Pointwise circumscription. In: Ginsberg M.L. (Ed). Readings in Nonmonotonic Reasoning (1987), Morgan Kaufmann, Los Altos, CA 179-193
50. Lifschitz V. Frames in the space of situations. Artificial Intelligence 46 3 (1990) 365-376
51. Lifschitz V. Circumscription. In: Gabbay D.M., Hogger C.J., and Robinson J.A. (Eds). Nonmonotonic Reasoning and Uncertain Reasoning. Handbook of Logic in Artificial Intelligence and Logic Programming vol. 3 (1994), Oxford University Press, Oxford 298-352
52. Lifschitz V. Book review: M. Shanahan, Solving the frame problem. Artificial Intelligence 123 1-2 (2000) 265-268
53. F. Lin. Embracing causality in specifying the indirect effects of actions. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1985-1993, San Mateo, CA, 1995. Morgan Kaufmann
54. Lin F., and Reiter R. State constraints revisited. Journal of Logic and Computation 4 5 (1994) 655-678
55. N.C. McCain and H. Turner. A causal theory of ramifications and qualifications. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1978-1984, San Mateo, CA, 1995. Morgan Kaufmann
56. J. McCarthy. Epistemological problems of artificial intelligence. In R. Reddy, editor, Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pages 1038-1044, Los Altos, CA, 1977. William Kaufmann
57. McCarthy J. Circumscription-a form of non-monotonic reasoning. Artificial Intelligence 13 1-2 (1980) 27-39
58. J. McCarthy. Applications of circumscription to formalizing common sense knowledge. In Proceedings of the Non-Monotonic Reasoning Workshop, pages 295-324, Menlo Park, CA, 1984. AAAI Press
59. McCarthy J. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence 28 (1986) 89-116
60. McCarthy J. Generality in artificial intelligence. Communications of the ACM 30 12 (1987) 1030-1035
61. J. McCarthy. Elaboration tolerance. In R. Miller and M. Shanahan, editors, Fourth Symposium on Logical Formalizations of Commonsense Reasoning, London, 1998. Queen Mary and Westfield College
62. McCarthy J., and Hayes P.J. Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer B., and Michie D. (Eds). Machine Intelligence vol. 4 (1969), Edinburgh University Press, Edinburgh, Scotland 463-502
63. Miller R., and Shanahan M. Narratives in the situation calculus. Journal of Logic and Computation 4 5 (1994) 513-530
64. R. Miller and M. Shanahan. Reasoning about discontinuities in the event calculus. In L.C. Aiello, J. Doyle, and S.C. Shapiro, editors, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, pages 63-74, San Francisco, 1996. Morgan Kaufmann
65. Miller R., and Shanahan M. The event calculus in classical logic-Alternative axiomatisations. Linköping Electronic Articles in Computer and Information Science 4 016 (1999)
66. Miller R., and Shanahan M. Some alternative formulations of the event calculus. In: Kakas A.C., and Sadri F. (Eds). Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part II. Lecture Notes in Computer Science vol. 2408 (2002), Springer, Berlin 452-490
67. Missiaen L., Bruynooghe M., and Denecker M. Chica, an abductive planning system based on event calculus. Journal of Logic and Computation 5 5 (1995) 579-602
68. Morgenstern L. Mid-sized axiomatizations of commonsense problems: A case study in egg cracking. Studia Logica 67 (2001) 333-384
69. E.T. Mueller. Story understanding through multi-representation model construction. In G. Hirst and S. Nirenburg, editors, Text Meaning: Proceedings of the HLT-NAACL 2003 Workshop, pages 46-53. Association for Computational Linguistics, East Stroudsburg, PA, 2003
70. Mueller E.T. Event calculus reasoning through satisfiability. Journal of Logic and Computation 14 5 (2004) 703-730
71. E.T. Mueller. A tool for satisfiability-based commonsense reasoning in the event calculus. In V. Barr and Z. Markov, editors, Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, pages 147-152, Menlo Park, CA, 2004. AAAI Press
72. Mueller E.T. Understanding script-based stories using commonsense reasoning. Cognitive Systems Research 5 4 (2004) 307-340
73. Mueller E.T. Event calculus answer set programming (2005). http://www.signiform.com/csr/ecas/
74. Mueller E.T. Commonsense Reasoning (2006), Morgan Kaufmann, San Francisco
75. Mueller E.T. Event calculus and temporal action logics compared. Artificial Intelligence 170 11 (2006) 1017-1029
76. Mueller E.T. Modelling space and time in narratives about restaurants. Literary and Linguistic Computing 22 1 (2007) 67-84
77. Mueller E.T., and Sutcliffe G. Discrete event calculus deduction using first-order automated theorem proving. In: Konev B., and Schulz S. (Eds). Proceedings of the Fifth International Workshop on the Implementation of Logics, number ULCS-05-003 (2005), Department of Computer Science, University of Liverpool, Liverpool, UK 43-56
78. Mueller E.T., and Sutcliffe G. Reasoning in the event calculus using first-order automated theorem proving. In: Russell I., and Markov Z. (Eds). Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference (2005), AAAI Press, Menlo Park, CA 840-841
79. Niemelä I., and Simons P. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In: Dix J., Furbach U., and Nerode A. (Eds). Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science vol. 1265 (1997), Springer, Berlin 420-429
80. Nonnengart A., and Weidenbach C. Computing small clause normal forms. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. 1 (2001), Elsevier and MIT Press, Amsterdam and Cambridge, MA 335-367
81. E.P.D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In R.J. Brachman, H.J. Levesque, and R. Reiter, editors, Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, pages 324-332, San Mateo, CA, 1989. Morgan Kaufmann
82. Pinto J.A., and Reiter R. Temporal reasoning in logic programming: A case for the situation calculus. In: Warren D.S. (Ed). Logic Programming: Proceedings of the Tenth International Conference (1993), MIT Press, Cambridge, MA 203-221
83. Plaisted D.A., and Greenbaum S. A structure-preserving clause form translation. Journal of Symbolic Computation 2 (1986) 293-304
84. R. Reiter. Circumscription implies predicate completion (sometimes). In D.L. Waltz, editors, Proceedings of the National Conference on Artificial Intelligence, pages 418-420, Menlo Park, CA, 1982. AAAI Press
85. Reiter R. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems (2001), MIT Press, Cambridge, MA
86. Robinson J.A., and Voronkov A. Handbook of Automated Reasoning, vols. 1 and 2 (2001), Elsevier and MIT Press, Amsterdam and Cambridge, MA
87. Sadri F. Three recent approaches to temporal reasoning. In: Galton A.P. (Ed). Temporal Logics and their Applications (1987), Academic Press, London 121-168
88. F. Sadri and R.A. Kowalski. Variants of the event calculus. In L. Sterling, editor, Logic Programming: The Twelfth International Conference, pages 67-81, Cambridge, MA, 1995. MIT Press
89. E. Sandewall. Filter preferential entailment for the logic of action in almost continuous worlds. In N.S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 894-899, San Mateo, CA, 1989. Morgan Kaufmann
90. Sandewall E. Features and Fluents: The Representation of Knowledge about Dynamical Systems vol. I (1994), Oxford University Press, Oxford
91. Schubert L.K. Monotonic solution of the frame problem in the situation calculus: An efficient method for worlds with fully specified actions. In: Kyburg Jr. H.E., Loui R.P., and Carlson G.N. (Eds). Knowledge Representation and Defeasible Reasoning (1990), Kluwer, Dordrecht 23-67
92. B. Selman, H.A. Kautz, and D.A. McAllester. Ten challenges in propositional reasoning and search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 50-54, San Mateo, CA, 1997. Morgan Kaufmann
93. M. Shanahan. Prediction is deduction but explanation is abduction. In N.S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 1055-1060, San Mateo, CA, 1989. Morgan Kaufmann
94. M. Shanahan. Representing continuous change in the event calculus. In L.C. Aiello, editor, Proceedings of the Ninth European Conference on Artificial Intelligence, pages 598-603, London, 1990. Pitman
95. Shanahan M. A circumscriptive calculus of events. Artificial Intelligence 77 (1995) 249-284
96. M. Shanahan. Robotics and the common sense informatic situation. In W. Wahlster, editor, Proceedings of the Twelfth European Conference on Artificial Intelligence, pages 684-688, Chichester, UK, 1996. John Wiley
97. Shanahan M. Event calculus planning revisited. In: Steel S., and Alami R. (Eds). Recent Advances in AI Planning. Lecture Notes in Computer Science vol. 1348 (1997), Springer, Berlin 390-402
98. Shanahan M. Solving the Frame Problem (1997), MIT Press, Cambridge, MA
99. M. Shanahan. A logical formalisation of Ernie Davis's egg cracking problem. In R. Miller and M. Shanahan, editors, Fourth Symposium on Logical Formalizations of Commonsense Reasoning, London, 1998. Queen Mary and Westfield College
100. Shanahan M. The event calculus explained. In: Wooldridge M.J., and Veloso M.M. (Eds). Artificial Intelligence Today: Recent Trends and Developments. Lecture Notes in Computer Science vol. 1600 (1999), Springer, Berlin 409-430
101. M. Shanahan. The ramification problem in the event calculus. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 140-146, San Mateo, CA, 1999. Morgan Kaufmann
102. Shanahan M. What sort of computation mediates best between perception and action?. In: Levesque H.J., and Pirri F. (Eds). Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter (1999), Springer, Berlin 352-369
103. Shanahan M. An abductive event calculus planner. Journal of Logic Programming 44 1-3 (2000) 207-240
104. M. Shanahan. Abductive event calculus planners [Computer software], 2000
105. Shanahan M. The frame problem. In: Nadel L. (Ed). Encyclopedia of Cognitive Science vol. 2 (2002), Nature Publishing Group, London 144-150
106. Shanahan M. An attempt to formalise a non-trivial benchmark problem in common sense reasoning. Artificial Intelligence 153 (2004) 141-165
107. Shanahan M. Perception as abduction: Turning sensor data into meaningful representation. Cognitive Science 29 (2005) 103-134
108. M. Shanahan and D.A. Randell. A logic-based formulation of active visual perception. In D. Dubois, C.A. Welty, and M.-A. Williams, editors, Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning, pages 64-72, Menlo Park, CA, 2004. AAAI Press
109. Shanahan M., and Witkowski M. Event calculus planning through satisfiability. Journal of Logic and Computation 14 5 (2004) 731-745
110. G. Sutcliffe and C.B. Suttner. The TPTP problem library for automated theorem proving, 2005
111. Thielscher M. Ramification and causality. Artificial Intelligence 89 (1997) 317-364
112. Van Belleghem K., Denecker M., and De Schreye D. On the relation between situation calculus and event calculus. Journal of Logic Programming 31 1-3 (1997) 3-37
113. van Lambalgen M., and Hamm F. The Proper Treatment of Events (2005), Blackwell, Malden, MA
114. J. Wilk. Dynamic workflow pulling the strings. Distinguished Project (MEng). Department of Computing, Imperial College London, London, 2004
115. Yolum P., and Singh M.P. Reasoning about commitments in the event calculus: An approach for specifying and executing protocols. Annals of Mathematics and Artificial Intelligence 42 1-3 (2004) 227-253