Plan Generation by Linear Proofs: On Semantics

In realistic circumstances reasoning almost always encounters changes in time. In [BIB 86] a logical calculus—the so-called linear proofs—was proposed, which integrates such changes in the form of transition rules into a classical logic framework. This paper presents three ways towards the semantics for this calculus. First, we prove its soundness through a translation into a suitable situational calculus. Second, we interpret it in a particular modal semantics. Third, we propose how to extend the semantics of first-order logic for the expression of planning problems.

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Michael Georgeff,et al.  Reasoning about actions and plans , 1986 .

[3]  Y. Shoham.  What is the frame problem , 1987 .

[4]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[5]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[6]  Y Shoham,et al.  Chronological ignorance , 1987 .

[7]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[8]  David E. Smith,et al.  Reasoning About Action II: The Qualification Problem , 1988, Artif. Intell..

[9]  Bertram Fronhbfer.  PLANLOG: a language framework for the integration of procedural and logical programming , 1987, IJCAI 1987.

[10]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[11]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

[12]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.