Abstract
We introduce a new deductive approach to planning which is based on Horn clauses. Plans as well as situations are represented as terms and, thus, are first-class objects. As a consequence, we do neither need frame axioms nor state-literals. The only rule of inference is the SLDE-resolution rule, i.e. SLD-resolution, where the traditional unification algorithm has been replaced by an E-unification procedure. We examplify the properties of our method such as forward and backward reasoning, plan checking, and the integration of general theories. Finally, we present the calculus and show that it is sound and complete.
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
W. Bibel, L. Fariñas del Cerro, B. Fronöfer, and A. Herzig. Plan generation by linear proofs: on semantics. In German Workshop on Artificial Intelligence. Springer Verlag, 1989.
W. Bibel. A deductive solution for plan generation. New Generation Computing, 4: 115–132, 1986.
Wray L. Buntine and Hans-Jürgen Bürckert. On solving equations and disequations. Technical report, FB Informatik, Universität Kaiserslautern, 1989.
H. J. Bürckert. Lazy theory unification in Prolog: An extension of the Warren abstract machine. In German Workshop on Artificial Intelligence, 1986.
D. Chapman. Planning for conjunctive goals. Artificial Intelligence, 32 (3): 333–377, 1987.
Bertram Fronhöfer. Linearity and plan generation. New Generation Computing, 5, 1987.
J. H. Gallier and S. Raatz. Extending SLD-Resolution to equational horn clauses using E-unification. Journal of Logic Programming, 1989.
C. Green. Application of theorem proving to problem solving. In International Joint Conference on Artificial Intelligence, pages 219–239. Kaufmann, Los Altos, CA, 1969.
Joachim Hertzberg and Alexander Horz. Towards a theory of conflict detection and resolution in nonlinear plans. Technical report, Gesellschaft für Mathematik und Datenverarbeitung mbH (GMD ), 1988.
Joachim Hertzberg. Planen. Einßhrung in die Planerstellungsmethoden der Kustlichen Intelli¬genz. B.I. Wissenschaftsverlag, 1989.
S. Hölldobler and Josef Schneeberger. A new deductiv approach to planning. Forschungsbericht, Technische Hochschule Darmstadt, FG Intellektik/Künstliche Intelligenz, 1989.
Steffen Hölldobler. Foundations of Equational Logic Programming, volume 353 oiLNCS. Springer Verlag, 1989. (to appear).
J. Jaffar, J.-L. Lassez, and M. J. Maher. A theory of complete logic programs with equality. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 175–184, 1984.
J. Jaffar, J.-L. Lassez, and M. J. Maher. A logic programming language scheme. In DeGroot and Lindstrom, editors, Logic Programming, pages 441–467. Prentice Hall, 1986.
Robert Kowalski. Logic for Problem Solving. Artificial Intelligence Series. North-Holland, New- York, Amsterdam, Oxford, 1979.
Vladimir Lifschitz. On the semantics of strips. In M. P. Georgeff and A. L. Lansky, editors, Reasoning about Actions and Plans, pages 1–8, Los Altos, 1986. Morgan Kaufmann.
M. Livesey and J. H. Siekmann. Unification of AC-terms (bags) and ACI-terms (sets). Technical report, University of Essex (1975) and University of Karlsruhe, 1976.
J. W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1984.
Zohar Manna and Richard Waldinger. Towards automatic program synthesis. Com-munications of the ACM, 14: 151–165, 1971.
John McCarthy and Patrick Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meitzer and D. Michie, editors, Machine Intelligence, vol. 4, pages 463–502. Edinburgh University Press, Edinburgh, 1969.
R. Reiter. On closed world data bases. In Gallaire and Nicolas, editors, Proceedings, Workshop on Logic and Databases. 1977.
J. C. Sheperdson. Negation as failure: A comparison of dark’s complete data base and reiter’s closed world assumption. Journal of Logic Programming, pages 51–79, 1984.
Jörg Siekmann. Unification theory. In Proceedings of the European Conference on Artificial Intelligence, pages 365–400, 1986.
Jörg Siekmann. Unification theory. Journal of Symbolic Computation, 1989. (to appear).
Gerald Jay Sussman. A Computer Model of Skill Acquisition. Elsevier Publishing, 1975.
W. Swartout (editor). DARPA Santa Cruz workshop on planning. AI Magazine, Summer: 115–130, 1988.
David H. D. Warren. An abstract prolog instruction set. Technical Note 309, Stanford Research Institute (SRI), 333 Ravenswood Ave., Menlo Pare, CA 94025, October 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hölldobler, S., Schneeberger, J. (1989). A New Deductive Approach to Planning. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-75100-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51743-6
Online ISBN: 978-3-642-75100-4
eBook Packages: Springer Book Archive