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. © Springer-Verlag 2004.
CITATION STYLE
Perdra, S. D. L., & De Barros, L. N. (2004). Planning with abduction: A logical framework to explore extensions to classical planning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3171, 62–72. https://doi.org/10.1007/978-3-540-28645-5_7
Mendeley helps you to discover research relevant for your work.