Representing Action and Change by Logic Programs

Abstract We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics of action based on states and transition functions.

[1]  Murray Shanahan,et al.  Prediction is Deduction but Explanation is Abduction , 1989, IJCAI.

[2]  G. Neelakantan Kartha,et al.  Soundness and Completeness Theorems for Three Formalizations of Action , 1993, IJCAI.

[3]  Lenhart K. Schubert.  Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

[4]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[5]  Vladimir Lifschitz,et al.  Automated Reasoning About Actions: A Logic Programming Approach , 1993, ILPS.

[6]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[7]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[8]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[9]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[10]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[11]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

[12]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[13]  Andrew B. Baker,et al.  Nonmonotonic Reasoning in the Framework of Situation Calculus , 1991, Artif. Intell..

[14]  Henry A. Kautz.  The Logic of Persistence , 1986, AAAI.

[15]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[16]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[17]  Vladimir Lifschitz,et al.  Miracles in Formal Theories of Action , 1989, Artif. Intell..

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

[19]  Chris Evans,et al.  Negation-as-failure as an approach to the Hanks-McDermott problem , 1989 .

[20]  Varol Akman,et al.  Formalizing common sense: Papers by John McCarthy: V. Lifschitz, ed., (Ablex Publishing Corporation, Norwood, NJ, 1990); vi+256 pages, hardback, ISBN 0-89391-535-1 (Library of Congress: Q335.M38 1989) , 1995 .

[21]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[22]  José Júlio Alferes,et al.  Nonmonotonic Reasoning with Well Founded Semantics. , 1991 .

[23]  Chitta Baral,et al.  Representing Concurrent Actions in Extended Logic Programming , 1993, IJCAI.

[24]  Paul H. Morris,et al.  The Anomalous Extension Problem in Default Reasoning , 1988, Artif. Intell..

[25]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[26]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

[27]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[28]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[29]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[30]  Michael Gelfond,et al.  What are the Limitations of the Situation Calculus? , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.