Abstract
In this work we show how a planner implemented as an abductive reasoning process can have the same performance and behavior as classical planning algorithms. We demonstrate this result by considering three different versions of an abductive event calculus planner on reproducing some important comparative analyses of planning algorithms found in the literature. We argue that a logic-based planner, defined as the application of general purpose theorem proving techniques to a general purpose action formalism, can be a very solid base for the research on extending the classical planning approach.
This work has been supported by the Brazilian sponsoring agencies Capes and CNPq.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Green, C.: Application of theorem proving to problem solving. In: International Joint Conference on Artificial Intelligence, pp. 219–239. Morgan Kaufmann, San Francisco (1969)
Eshghi, K.: Abductive planning with event calculus. In: Proc.of the 5th International Conference on Logic Programming, pp. 562–579. MIT Press, Cambridge (1988)
Missiaen, L., Bruynooghe, M., Denecker, M.: Chica, an abductive planning system based on event calculus (1994)
Shanahan, M.P.: An abductive event calculus planner. The Journal of Logic Programming 44, 207–239 (2000)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)
Shanahan, M.: A circumscriptive calculus of events. Artificial Intelligence 77, 249–284 (1995)
Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2, 719–770 (1992)
Knoblock, C., Yang, Q.: Evaluating the tradeoffs in partial-order planning algorithms (1994)
Kambhampati, S., Knoblock, C.A., Yang, Q.: Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence 76, 167–238 (1995)
Peirce, C.S.: Collected Papers of Charles Sanders Peirce. Harvard University Press, Cambridge (1958)
Cox, P.T., Pietrzykowski, T.: Causes for events: their computation and applications. In: Proc. of the 8th international conference on Automated deduction, pp. 608–621. Springer, New York (1986)
Kowalski, R.A., Sergot, M.J.: A logic-based calculus of events. New Generation Computing 4, 67–95 (1986)
Santos, P.E.: Formalising the common sense of a mobile robot (1998)
Shanahan, M.P.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge (1997)
Barrett, A., Weld, D.S.: Partial-order planning: Evaluating possible efficiency gains. Artificial Intelligence 67, 71–112 (1994)
MacAllester, D., Rosenblitt, D.: Systematic nonlinear planning. In: Proc. 9th National Conference on Artificial Intelligence, pp. 634–639. MIT Press, Cambridge (1991)
Chapman, D.: Planning for conjunctive goals. Artificial Intelligence 32, 333–377 (1987)
Pereira, S.L., Barros, L.N.: Efficiency in abductive planning. In: Proceedings of 2nd Congress of Logic Applied to Technology, Senac, São Paulo, pp. 213–222 (2001)
Pereira, S.L.: Abductive Planning in the Event Calculus. Master Thesis, Institute of Mathematics and Statistics - University of Sao Paulo (2002)
Kambhampati, S.: On the utility of systematicity: Understanding tradeoffs between redundancy and commitment in partial-ordering planning. In: Foundations of Automatic Planning: The Classical Approach and Beyond: Papers from the 1993 AAAI Spring Symposium, Menlo Park, California, pp. 67–72. AAAI Press, Menlo Park (1993)
Barros, L.N., Pereira, S.L.: High-level robot programs based on abductive event calculus. In: Proceedings of 3rd International Cognitive Robotics Workshop (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
do Lago Pereira, S., de Barros, L.N. (2004). Planning with Abduction: A Logical Framework to Explore Extensions to Classical Planning. In: Bazzan, A.L.C., Labidi, S. (eds) Advances in Artificial Intelligence – SBIA 2004. SBIA 2004. Lecture Notes in Computer Science(), vol 3171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28645-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-28645-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23237-7
Online ISBN: 978-3-540-28645-5
eBook Packages: Springer Book Archive