Reasoning in the event calculus using first-order automated theorem proving

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005 - Recent Advances in Artifical Intelligence

Volumn , Issue , 2005, Pages 840-841

  Mueller, Erik T ^a   Sutcliffe, Geoff ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Department of Computer Science and Center for Computational Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32844473986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Kowalski, R. A., and Sergot, M. J. 1986. A logic-based calculus of events. New Generation Computing 4(1):67-95.
2. Lifschitz, V. 1987. Formal theories of action. In The Frame Problem in Artificial Intelligence, 35-57.
3. McCarthy, J. 1979. First order theories of individual concepts and propositions. In Machine Intelligence 9. 129-148.
4. McCarthy, J. 1980. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence 13:27-39.
5. Miller, R., and Shanahan, M. 2002. Some alternative formulations of the event calculus. In Computational Logic: Logic Programming and Beyond. 452-490.
6. Mueller, E. T. 2004. Event calculus reasoning through satisfiability. Journal of Logic and Computation 14(5):703-730.
7. Riazanov, A., and Voronkov, A. 2002. The design and implementation of Vampire. AI Communications 15(2-3):91-110.
8. Shanahan, M. 1990. Representing continuous change in the event calculus. In Proc. of ECAI 1990, 598-603.
9. Shanahan, M. 1997. Solving the Frame Problem. MIT Press.
10. Shanahan, M. 1999. The event calculus explained. In Artificial Intelligence Today. Springer-Verlag. 409-430.
11. Sutcliffe, G., and Suttner, C. 1998. The TPTP Problem Library: CNF release v1.2.1. Journal of Automated Reasoning 21(2):177-203.