Abstract
A new deductive method for solving robot problems is presented in this paper. The descriptions of initial and goal situations are given by logical formulas. The primitive actions are described by rules, i.e. logical formulas as well. Altogether this results in a problem description as in logic programming or in program synthesis. A solution is generated by a proof of this description as in program synthesis, except that here proofs have to be strictly linear. This restriction is the clue to our solution; it can be easily added as an option to any theorem prover such as one based on the connection method used hereafter. In fact this restriction speeds up the proof search considerably. At the same time our approach offers an elegant solution of the frame problem.
First published in New Generation Computing, Vol. 4, No. 2, 1986, pp. 115–132.
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.
Similar content being viewed by others
References
Bibel, W., Farinos del Cerro, L., Fronhofer, B., Herzig, A., Plan Generation by Linear Proofs: On Semantics, (submitted), 1988.
Bibel, W., Automated Theorem Proving, Vieweg, Braunschweig, 1982, Second revised edition, 1987.
Bibel, W., “Matings in Matrices”, Communications of the ACM, Vol. 26, 1983, pp. 844–852.
Bibel, W., On the Semantics of an Action Logic, (Unpublished), 1988,
Fronhofer, B., Linearity and Plan Generation, New Generation Computing, Vol. 5, pp. 213–225, 1987.
Green, C., “Application of Theorem Proving to Problem Solving”, International Joint Conference on Artificial Intelligence 1969, Kaufmann, Los Altos, CA, 1969, pp. 219–239.
Kowalski, R.A., Logic for Problem Solving, North-Holland, New York, 1979.
McCarthy, J., and P.J. Hayes, “Some Philosophical Problems from the Standpoint of Artificial Intelligence”, in B. Meltzer and D. Michie (eds.), Machine Intelligence 4, Edinburgh Univ. Press, Edinburgh, 1969, pp. 463–502.
Manna, Z., and R. Waldinger, “Towards Automatic Program Synthesis”, Communications of the ACM, Vol. 14, 1971, pp. 151–165.
Nilsson, N.J., Principles of Artificial Intelligence, Tioga, Palo Alto, CA, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bibel, W. (1989). A Deductive Solution for Plan Generation. In: Schmidt, J.W., Thanos, C. (eds) Foundations of Knowledge Base Management. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83397-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-83397-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83399-1
Online ISBN: 978-3-642-83397-7
eBook Packages: Springer Book Archive