Skip to main content
SpringerLink
Log in
Book cover

Computational Logic: Logic Programming and Beyond pp 452–490Cite as

Some Alternative Formulations of the Event Calculus

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2408))

Abstract

The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this paper we summarise how variants of the Event Calculus may be expressed as classical logic axiomatisations, and how under certain circumstances these theories may be reformulated as “action description language” domain descriptions using the Language ε. This enables the classical logic Event Calculus to inherit various provably correct automated reasoning procedures recently developed for ε.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Baker, Nonmonotonic Reasoning in the Framework of the Situation Calculus, Artificial Intelligence, Vol 49(5–23), 1991.

    Google Scholar 

  2. I. Cervesato, L. Chittaro and A. Montanari, A Modal Calculus of Partially Ordered Events in a Logic Programming Framework, in Proceedings ICLP’95, MIT Press, pages 299–313, 1995.

    Google Scholar 

  3. I. Cervesato, L. Chittaro and A. Montanari, A General Modal Framework for the Event Calculus and its Skeptical and Credulous Variants, in in W. Wahlster, editor, Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI’96), pp. 33–37, John Wiley and Sons, 1996.

    Google Scholar 

  4. I. Cervesato, M. Franceschet and A. Montanari, A Hierarchy of Modal Event Calculi: Expressiveness and Complexity, in H. Barringer et al, Proceedings of the 2nd International Conference on Temporal Logic (ICTL’97, pp. 1–17, Kluwer Applied Logic Series, 1997.

    Google Scholar 

  5. I. Cervesato, M. Franceschet and A. Montanari, Modal Event Calculi with Preconditions, in R. Morris and L. Khatib, Proceedings of the Fourth International Workshop on Temporal Reasoning (TIME’97), pp. 38–45, IEEE Computer Society Press, 1997.

    Google Scholar 

  6. I. Cervesato, M. Franceschet and A. Montanari, The Complexity of Model Checking in Modal Event Calculi with Quantifiers, Journal of Electronic Transactions on Artificial Intelligence, Linköping University Electronic Press, http://www.ida.liu.se/ext/etai/, 1998.

  7. L. Chittaro, A. Montanari and A. Provetti, Skeptical and Credulous Event Calculi for Supporting Modal Queries, in A. Cohn, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI’94), pp. 361–365, John Wiley and Sons, 1994.

    Google Scholar 

  8. N. Chleq, Constrained Resolution and Abductive Temporal Reasoning, Computational Intelligence, vol. 12, no. 3, pp. 383–406, 1996.

    Article  MathSciNet  Google Scholar 

  9. J. M. Crawford and D. W. Etherington, Formalizing Reasoning about Change: A Qualitative Reasoning Approach, Proceedings AAAI’92, pp. 577–583, 1992.

    Google Scholar 

  10. J. Davila, Reactive Pascal and the Event Calculus, Proceedings FAPR’96 Workshop on Reasoning about Actions and Planning in Complex Environments, eds. U. Siegmund and M. Thielscher, vol. 11of Technical Report AIDA, 1996.

    Google Scholar 

  11. M. Denecker, L. Missiaen and M. Bruynooghe, Temporal Reasoning with Abductive Event Calculus, in Proceedings ECAI 92, Vienna, 1992.

    Google Scholar 

  12. M. Denecker, K. Van Belleghem, G. Duchatelet, F. Piessens and D. De Schreye A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification, in Proceedings of the Joint International Conference and Symposium on Logic Programming, 1996.

    Google Scholar 

  13. M. Denecker, D. Theseider Dupré, and K. Van Belleghem, An Inductive Definition Approach to Ramifications, in Electronic Transactions on Artificial Intelligence, vol 2, 1998.

    Google Scholar 

  14. P. Doherty, Reasoning about Action and Change Using Occlusion, Proceedings ECAI’94, pp. 401–405, 1994.

    Google Scholar 

  15. K. Eshghi, Abductive Planning with Event Calculus, Proceedings of the 5th International Conference and Symposium on Logic Programming, ed.s Robert Kowalski and Kenneth Bowen, MIT Press, pp. 562–579, 1988.

    Google Scholar 

  16. M. Gelfond and V. Lifschitz, Representing Actions in Extended Logic Programming, JICSLP’92, ed. Krzysztof Apt, 560, MIT Press, 1992.

    Google Scholar 

  17. M. Gelfond and V. Lifschitz, Representing Action and Change by Logic Programs, JLP, 17(2,3,4) 301–322, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. C. Jeffrey, Formal Logic: Its Scope and Limits, McGraw-Hill, 1967.

    Google Scholar 

  19. C. G. Jung, K. Fischer and A. Burt, Multi-Agent Planning Using an Abductive Event Calculus, DFKI Report RR-96-04 (1996), DFKI, Germany, 1996.

    Google Scholar 

  20. C. G. Jung, Situated Abstraction Planning by Abductive Temporal Reasoning, Proceedings ECAI’98, pp. 383–387, 1998.

    Google Scholar 

  21. A. Kakas and R. Miller, A Simple Declarative Language for Describing Narratives with Actions, JLP 31(1–3) (Special Issue on Reasoning about Action and Change) 157–200, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  22. A. Kakas and R. Miller, Reasoning about Actions, Narratives and Ramifications, Journal of Electronic Transactions on Artificial Intelligence 1(4), Linköping University Electronic Press, http://www.ida.liu.se/ext/etai/, 1998.

  23. A. Kakas, R. Miller and F. Toni, An Argumentation Framework for Reasoning about Actions and Change, Proceedings of LPNMR’99, 1999.

    Google Scholar 

  24. A. Kakas, R. Miller and F. Toni, E-RES-A System for Reasoning about Actions, Events and Observations, Proceedings of NMR 2000, Special Session on System Demonstrations and Descriptions, http://xxx.lanl.gov/abs/cs.AI/0003034, 2000.

  25. A. Kakas, R. Miller and F. Toni, Planning with Incomplete Information, Proceedings of NMR 2000, Special Session on Representing Actions and Planning, http://xxx.lanl.gov/abs/cs.AI/0003049~L, 2000.

  26. A. Kakas, R. Miller and F. Toni, E-RES-Reasoning about Actions, Events and Observations, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’2001), September 17–19, 2001, Vienna, Austria, ed. T. Eiter, M. Truszczynski and W. Faber, pub. Springer-Verlag (LNCS/LNAI series), 2001.

    Google Scholar 

  27. G. N. Kartha, Soundness and Completeness Theorems for Three Formalizations of Action, Proceedings IJCAI’93, page 724, 1993.

    Google Scholar 

  28. G. N. Kartha and V. Lifschitz, A Simple Formalization of Actions Using Circumscription, Proceedings IJCAI’95, pp. 1970–1975, 1995.

    Google Scholar 

  29. R. A. Kowalski, Database Updates in the Event Calculus, Journal of Logic Programming, vol. 12, pp. 121–146, 1992.

    Article  MathSciNet  Google Scholar 

  30. R. A. Kowalski, Legislation as Logic Programs, Informatics and the Foundations of Legal Reasoning, Kluwer Academic Publishers, ed.s Z. Bankowski et al., pp. 325–356, 1995.

    Google Scholar 

  31. R. A. Kowalski and F. Sadri, The Situation Calculus and Event Calculus Compared, in Proceedings of the International Logic Programming Symposium (ILPS’94), 1994.

    Google Scholar 

  32. R. A. Kowalski and F. Sadri, Reconciling the Event Calculus with the Situation Calculus, Journal of Logic Programming, Special Issue on Reasoning about Action and Change, vol. 31, pp. 39–58, 1997.

    MATH  MathSciNet  Google Scholar 

  33. R. A. Kowalski and M. J. Sergot, A Logic-Based Calculus of Events, New Generation Computing, vol. 4, pp. 67–95, 1986.

    Article  Google Scholar 

  34. B. Kuipers, Qualitative Reasoning: Modeling and Simulation with Incomplete Knowledge, MIT Press, 1994.

    Google Scholar 

  35. F. Lévy and Joachim Quantz, Representing Beliefs in a Situated Event Calculus, Proceedings ECAI’98, pp. 547–551, 1998.

    Google Scholar 

  36. H. Levesque, What is Planning in the Presence of Sensing?, in Proceedings of AAAI’96, 1996.

    Google Scholar 

  37. V. Lifschitz, Circumscription, in The Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning, ed. D. M. Gabbay, C.J. Hogger and J. A. Robinson, Oxford University Press, pp. 297–352, 1994.

    Google Scholar 

  38. J. Lobo, G. Mendez and S. Taylor, Adding Knowledge to the Action Description Language A, in Proceedings of AAAI’97, 1997.

    Google Scholar 

  39. J. McCarthy, Circumscription N A Form of Non-Monotonic Reasoning, Artificial Intelligence, vol. 13, pp. 27–39, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  40. J. McCarthy and P. J. Hayes, Some Philosophical Problems from the Standpoint of Artificial Intelligence, in Machine Intelligence 4, ed. D. Michie and B. Meltzer, Edinburgh University Press, pp. 463–502, 1969.

    Google Scholar 

  41. R. Miller, Situation Calculus Specifications for Event Calculus Logic Programs, in Proceedings of the Third International Conference on Logic Programming and Non-monotonic Reasoning, Lexington, KY, USA, Springer Verlag, 1995.

    Google Scholar 

  42. R. S. Miller and M. P. Shanahan, Reasoning about Discontinuities in the Event Calculus, Proceedings 1996 Knowledge Representation Conference (KR’96), pp. 63–74, 1996.

    Google Scholar 

  43. R. S. Miller and M. P. Shanahan, The Event Calculus in Classical Logic-Alternative Axiomatisations, Journal of Electronic Transactions on Artificial Intelligence, Vol. 3 (1999), Section A, pages 77–105, http://www.ep.liu.se/ej/etai/1999/016/, 1999.

    MathSciNet  Google Scholar 

  44. L. R. Missiaen, Localized Abductive Planning for Robot Assembly, Proceedings 1991 IEEE Conference on Robotics and Automation, pub. IEEE Robotics and Automation Society, pages 605–610, 1991.

    Google Scholar 

  45. L. R. Missiaen, M. Denecker and M. Bruynooghe, An Abductive Planning System Based on Event Calculus, Journal of Logic and Computation, volume 5, number 5, pages 579–602, 1995.

    Article  MATH  Google Scholar 

  46. R. C. Moore, A Formal Theory of Knowledge and Action, In Hobbs and Moore, ed.s, Formal Theories of the Commonsense World, Ablex, Norwood, USA, 1985.

    Google Scholar 

  47. L. Morgenstern, Knowledge Preconditions for Actions and Plans, in Proceedings of the International Joint Conference in Artificial Intelligence 1987 (IJCAI’97), Morgan Kaufmann, 1987.

    Google Scholar 

  48. J. Pinto and R. Reiter, Temporal Reasoning in Logic Programming: A Case for the Situation Calculus, Proceedings ICLP 93, page 203, 1993.

    Google Scholar 

  49. A. Provetti, Hypothetical Reasoning about Actions: From Situation Calculus to Event Calculus, Computational Intelligence, volume 12, number 2, 1995.

    Google Scholar 

  50. R. Reiter, The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression, in Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, ed. V. Lifschitz, Academic Press, pp. 359–380, 1991.

    Google Scholar 

  51. R. Reiter, Natural actions, concurrency and continuous time in the situation calculus, in Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR’96), Cambridge, Massachusetts, U.S.A, November 5–8, 1996.

    Google Scholar 

  52. A. Russo, R. Miller, B. Nuseibeh and J. Kramer, An Abductive Approach for Handling Inconsistencies in SCR Specifications, in proceedings of the 3rd International Workshop on Intelligent Software Engineering (WISE3), Limerick, Ireland, June, 2000.

    Google Scholar 

  53. F. Sadri and R. Kowalski, Variants of the Event Calculus, Proceedings of the International Conference on Logic Programming, Kanagawa, Japan, Stirling L. (Ed), The MIT Press, pp. 67–81, 1995.

    Google Scholar 

  54. E. Sandewall, Combining Logic and Differential Equations for Describing Real World Systems, Proceedings KR’89, Morgan Kaufman, 1989.

    Google Scholar 

  55. E. Sandewall, Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds, Proceedings IJCAI’89, pages 894–899, 1989.

    Google Scholar 

  56. E. Sandewall, The Representation of Knowledge about Dynamical Systems, Volume 1, Oxford University Press, 1994.

    Google Scholar 

  57. R. Scherl and H. Levesque, The Frame Problem and Knowledge-Producing Actions, in Proceedings of AAAI’93, 1993.

    Google Scholar 

  58. M. P. Shanahan, Representing Continuous Change in the Event Calculus, Proceedings ECAI’90, pp. 598–603, 1990.

    Google Scholar 

  59. M. P. Shanahan, A Circumscriptive Calculus of Events, Artificial Intelligence, vol 77 (1995), pages 249–284, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  60. M. P. Shanahan, Robotics and the Common Sense Informatic Situation, Proceedings ECAI’96, pp. 684–688, 1996.

    Google Scholar 

  61. M. P. Shanahan, Noise and the Common Sense Informatic Situation for a Mobile Robot, Proceedings AAAI’96, pp. 1098–1103, 1996.

    Google Scholar 

  62. M. P. Shanahan, Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia, MIT Press, 1997.

    Google Scholar 

  63. M. P. Shanahan, Event Calculus Planning Revisited, Proceedings 4th European Conference on Planning (ECP’97), Springer Lecture Notes in Artificial Intelligence no. 1348, pp. 390–402, 1997.

    Google Scholar 

  64. M. P. Shanahan, Noise, Non-Determinism and Spatial Uncertainty, Proceedings AAAI’97, pp. 153–158, 1997.

    Google Scholar 

  65. M. P. Shanahan, Reinventing Shakey, Working Notes of the 1998 AAAI Fall Symposium on Cognitive Robotics, pp. 125–135, 1998.

    Google Scholar 

  66. M. P. Shanahan, The Ramification Problem in the Event Calculus, Proceedings IJCAI’99, 1999.

    Google Scholar 

  67. M. P. Shanahan, A Logical Account of the Common Sense Informatic Situation for a Mobile Robot, Electronic Transactions on Artificial Intelligence, 1999.

    Google Scholar 

  68. M. P. Shanahan, The Event Calculus Explained, in Artificial Intelligence Today, eds. M. J. Wooldridge and M. Veloso, Springer-Verlag Lecture Notes in Artificial Intelligence no. 1600, Springer-Verlag, pages 409–430, 1999.

    Google Scholar 

  69. E. Ternovskaia, Inductive Definability and the Situation Calculus, in “Transactions and Change in Logic Databases”, Lecture Notes in Computer Science, volume 1472, Ed. Freitag B., Decker H., Kifer M. (Eds.), pub. Springer Verlag, 1997.

    Google Scholar 

  70. E. Ternovskaia, Causality via Inductive Definitions, in Working Notes of “Prospects for a Commonsense Theory of Causation”, pages 94–100, AAAI Spring Symposium Series, March 23–28, 1998.

    Google Scholar 

  71. K. Van Belleghem, M. Denecker and D. De Schreye, Representing Continuous Change in the Abductive Event Calculus, in Proceedings 1994 International Conference on Logic Programming, ed. P. Van Hentenrijck, pages 225–240, 1994.

    Google Scholar 

  72. K. Van Belleghem, M. Denecker and D. De Schreye, The Abductive Event Calculus as a General Framework for Temporal Databases, Proceedings of the International Conference on Temporal Logic, 1994.

    Google Scholar 

  73. K. Van Belleghem, M. Denecker and D. De Schreye, Combining Situation Calculus and Event Calculus, in Proceedings of the International Conference on Logic Programming, 1995.

    Google Scholar 

  74. K. Van Belleghem, M. Denecker and D. De Schreye, On the Relation Between Situation Calculus and Event Calculus, Journal of Logic Programming, 31(1–3) (Special Issue on Reasoning about Action and Change), 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University College London, London, WC1E 6BT, UK

    Rob Miller

  2. Technology and Medicine, Imperial College of Science, London, SW7 2BT, UK

    Murray Shanahan

Authors
  1. Rob Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Murray Shanahan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Miller, R., Shanahan, M. (2002). Some Alternative Formulations of the Event Calculus. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45632-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45632-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43960-8

  • Online ISBN: 978-3-540-45632-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation