Skip to main content
SpringerLink
Log in

A deductive solution for plan generation

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

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 like in logic programming or in program synthesis. A solution is generated by a proof of this description like in program synthesis, except that here proofs have to be strictly linear. This restriction is the clue of 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bibel, W.,Automated theorem proving, Vieweg, Braunschweig, 1982.

    MATH  Google Scholar 

  2. Bibel, W., “Matings in matrices,”CACM, 26, pp. 844–852, 1983.

    MATH  MathSciNet  Google Scholar 

  3. Bibel, W., “Predicative programming revisited,” inMMSSSS’85 (W. Bibel and K. Jantke, eds.),Lecture Notes in Computer Science, 215, Springer, Berlin, 1986.

    Google Scholar 

  4. Fronhöfer, B., “Linearity and plan generation,”Report ATP-51-I-86, Techn. Univ. München, 1986.

  5. Green, C., “Application of theorem proving to problem solving,”IJCAI-69, Kaufmann, Los Altos, CA, pp. 219–239, 1969.

    Google Scholar 

  6. Kowalski, R.,Logic for problem solving, North-Holland, New York, NY, 1979.

    MATH  Google Scholar 

  7. Manna, Z. and Waldinger, R., “Towards automatic program synthesis,”CACM, 14, pp. 151–165, 1971.

    MATH  Google Scholar 

  8. McCarthy, J. and Hayes, P., “Some philosophical problems from the standpoint of Artificial Intelligence,” inMachine Intelligence, 4 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 463–502, 1969.

    Google Scholar 

  9. Nilsson, N. J.,Principles of Artificial Intelligence, Tioga, Palo Alto, CA, 1980.

    MATH  Google Scholar 

Download references

Author information

Author notes

  1. Wolfgang Bibel

    Present address: FG Künstliche Intelligenz, Technische Universität München, Germany

Authors and Affiliations

  1. Department of Computer Science, Duke University, Durham, NC, USA

    Wolfgang Bibel

Authors
  1. Wolfgang Bibel
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Bibel, W. A deductive solution for plan generation. New Gener Comput 4, 115–132 (1986). https://doi.org/10.1007/BF03037438

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037438

Keywords

Search

Navigation