Event calculus planning through satisfiability

Journal of Logic and Computation

Volumn 14, Issue 5, 2004, Pages 731-745

  Shanahan, Murray ^a   Witkowski, Mark ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Event calculus; Satisfiability planning

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTELLIGENT AGENTS; LOGIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING;

CALCULUS PLANNING PROBLEMS; EVENT CALCULUS; SATISFIABILITY PLANNING;

FORMAL LOGIC;

EID: 7544242317     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.5.731     Document Type: Article

References (23)

1. A.L. Blum and M.L. Forst. Fast planning through planning graph analysis. Artificial Intelligence, 90, 281-300, 1997.
2. M. Denecker, L. Missiaen, and M. Biuynooghe. Temporal reasoning with abductive event calculas, Proceedings ECAI 92, pp. 384-388, 1992.
3. M. D. Ernst, T. D. Millstein, and D. S. Weld. Automatic SAT-compilation of planning problems, Proceedings IJCAI97, pp. 1169-1176, 1997.
4. K. Eshghi. Abductive planning with event calculus, Proceedings of the Fifth International Conference on Logic Programming, pp.562-579, 1998.
5. E. Giunchiglia. Planning as satisfiability with expressive action languages: concurrency, constraints and nondeterminism, Proceedings KR 2000, pp. 657-666, 2000.
6. A. R. Haas. The case for domain-specific frame axioms, Proceedings of the 1987 Workshop on the Frame Problem, pp. 343-348, 1987.
7. C. G. Jung, K. Fischer, and A. Hurt. Multi-agent planning using an abductive event calculus, DFKI Report RR-96-04, DFKI, Germany, 1996.
8. C. G. Jung. Situated abstraction planning by abductive temporal reasoning, Proceedings ECAI 98, pp. 383-387, 1998.
9. A. C. Kakas, A. Michael, and C. Mourlas. ACLP: abductive constraint logic programming, The Journal of Logic Programming, 44, 129-177, 2000.
10. H. Kautz and B. Selman. Planning as satisfiability, Proceedings ECAI 92, pp. 359-363, 1992.
11. H. Kautz and B. Selman. Pushing the envelope: planning, prepositional logic and stochastic search, Proceedings AAAI 96, pp. 1194-1201, 1996.
12. H. Kautz and B. Selman. Unifying SAT-based and graph-based planning, Proceedings IJCAI 99, pp. 318-325, 1999.
13. F. Levy and J. J. Quantz. Representing beliefs in a situated event calculus, Proceedings ECAI 98, pp. 547-551, 1998.
14. V. Lifschitz. Circumscription. In The Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning, D.M. Gabbay, C.J. Hogger and J.A. Robinson, eds. pp. 297-352. Oxford University Press, 1994.
15. R. S. Miller and M. P. Shanahan. Some alternative formulations of the event calculus. In Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, pp. 452-490. Vol 2408 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2002.
16. L. Missiaen, M. Bruynooghe and M. Denecker. CHICA, a planning system based on event calculus, The Journal of Logic and Computation, 5, 579-602, 1995.
17. L. Morgenstern. Mid-sized axiomatizations of commonsense problems: a case study in egg cracking, Studia Logica, 67, 333-384, 2001.
18. E. T. Mueller. Event calculus reasoning through satisfiability, The Journal of Logic and Computation, 14, 703-730, 2004.
19. J. S. Penberthy and D. S. Weld. UCPOP: a sound, complete, partial order planner for ADL, Proceedings KR 92, pp. 103-114, 1992.
20. M. P. Shanahan. Robotics and the common sense informatic situation, Proceedings ECAI 96, pp. 684-688, 1996.
21. M. P. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia, MIT Press, 1997.
22. M. P. Shanahan. The ramification problem in the event calculus, Proceedings IJCAI 99, pp. 140-146, 1999.
23. M. P. Shanahan. An abductive event calculus planner, The Journal of Logic Programming, 44,207-239, 2000.