Abstract
Problems in commonsense and robot planning are approached by methods adapted from program synthesis research; planning is regarded as an application of automated deduction. To support this approach, we introduce a variant of situational logic, called plan theory, in which plans are explicit objects.
A machine-oriented deductive-tableau inference system is adapted to plan theory. Equations and equivalences of the theory are built into a unification algorithm for the system. Frame axioms are built into the resolution rule.
Special attention is paid to the derivation of conditional and recursive plans. Inductive proofs of theorems for even the simplest planning problems, such as clearing a block, have been found to require challenging generalizations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boyer and Moore [79]: R. S. Boyer and J S. Moore, A Computational Logic Academic Press, Orlando, Fla., 1979.
Digricoli and Harrison [86]: V. J. Digricoli and M. C. Harrison, ‘Equality-based binary resolution’, Journal of the ACM 33, April 1986, pp. 253–289.
Fay [79]: M. Fay, ‘First-order unification in an equational theory’, Proceedings of the Fourth Workshop on Automated Deduction, Austin, Texas, Feb. 1979, pp. 161–167.
Fikes and Nilsson [71]: R. E. Fikes and N. J. Nilsson, ‘strips: A new approach to the application of theorem proving to problem solving’, Artificial Intelligence 2, Winter 1971, pp. 189–208.
Green [69]: C. C. Green, ‘Application of theorem proving to problem solving’, Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., May 1969, pp. 219–239.
Hullot [80]: J.-M. Hullot, ‘Canonical forms and unification’, Proceedings of the Fifth Conference on Automated Deduction, Les Arcs, France, July 1980, pp. 318–334.
Kowalski [79]: R. Kowalski, Logic for Problem Solving, North-Holland, New York, N.Y., 1979.
Lifschitz [85]: V. Lifschitz, ‘Circumscription in the blocks world’, unpublished report, Stanford University, Stanford, Calif., Dec. 1985.
McCarthy [63]: J. McCarthy, ‘Situations, actions, and causal laws’, technical report, Stanford University, Stanford, Calif., 1963. Reprinted in Semantic Information Processing (Marvin Minsky, editor), MIT Press Cambridge, Mass., 1968, pp. 410–417.
McCarthy and Hayes [69]: J. McCarthy and P. Hayes, ‘Some philosophical problems from the standpoint of artificial intelligence’, Machine Intelligence 4 (B. Meltzer and D. Michie, editors), American Elsevier, New York, N.Y., 1969, pp. 463–502.
Manna and Waldinger [80]: Z. Manna and R. Waldinger, ‘A deductive approach to program synthesis’, ACM Transactions on Programming Languages and Systems 2, Jan. 1980, pp. 90–121.
Manna and Waldinger [85a]: Z. Manna and R. Waldinger, ‘The origin of the binary-search paradigm’, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, Calif., Aug. 1985, pp. 222–224. Also in Science of Computer Programming (to appear).
Manna and Waldinger [85b]: Z. Manna and R. Waldinger, The Logical Basis for Computer Programming, Vol. 1: Deductive Reasoning, Addison-Wesley, Reading, Mass., 1985.
Manna and Waldinger [86]: Z. Manna and R. Waldinger, ‘Special relations in automated deduction’, Journal of the ACM 33, April 1986, pp. 1–60.
Martelli and Rossi [86]: A. Martelli and G. Rossi, ‘An algorithm for unification in equational theories’, Proceedings of the Third Symposium on Logic Programming, Salt Lake City, Utah, Sept. 1986.
Morris [69]: J. B. Morris, ‘E-resolution: Extension of resolution to include the equality relation’, Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., May 1969, pp. 287–294.
Murray [82]: N. V. Murray, ‘Completely nonclausal theorem proving’, Artificial Intelligence 8, 1982, pp. 67–85.
Polya [57]: G. Polya, How to Solve It, Doubleday and Company, Garden City, N.Y., 1957.
Stickel [85]: M. E. Stickel, ‘Automated deduction by theory resolution’, Journal of Automated Reasoning 1, 1985, pp. 333–355.
Sussman [73]: G. J. Sussman, A Computational Model of Skill Acquisition, Ph.D. thesis, MIT, Cambridge, Mass., 1973.
Waldinger and Lee [69]: R. J. Waldinger and R. C. T. Lee, ‘prow: A step toward automatic program writing’, Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., May 1969, pp. 241–252.
Warren [74]: D. H. D. Warren, ‘warplan: A system for generating plans’, technical report, University of Edinburgh, Edinburgh, Scotland, 1974.
Author information
Authors and Affiliations
Additional information
This research was supported by the National Science Foundation under Grants DCR-82-14523 and DCR-85-12356, by the Defense Advanced Research Projects Agency under Contract N00039-84-C-0211, by the United States Air Force Office of Scientific Research under Contract AFOSR-85-0383, by the Office of Naval Research under Contract N00014-84-C-0706, by United States Army Research under Contract DAJA-45-84-C-0040, and by a contract from the International Business Machines Corporation.
Rights and permissions
About this article
Cite this article
Manna, Z., Waldinger, R. How to clear a block: A theory of plans. J Autom Reasoning 3, 343–377 (1987). https://doi.org/10.1007/BF00247434
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00247434