Reasoning About Effects of Concurrent Actions

Abstract Gelfond and Lifschitz introduce a declarative languageAfor describing effects of actions and describe translations of theories in this language into extended logic programs. In this paper we extend the languageAand its translation to allow reasoning about the effects of concurrent actions. The logic programming formalization of situation calculus with concurrent actions presented in the paper is of independent interest and may serve as a test bed for the investigation of various transformations and logic programming inference mechanisms.

[1]  Raymond Reiter,et al.  Formalizing Database Evolution in the Situation Calculus , 1992, FGCS.

[2]  Raymond Reiter,et al.  Temporal Reasoning in Logic Programming: A Case for the Situation Calculus , 1993, ICLP.

[3]  R. Reiter,et al.  Temporal reasoning in the situation calculus , 1994 .

[4]  Robert A. Kowalski,et al.  Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes) , 1988, ICLP/SPL.

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

[6]  Rob Miller,et al.  Situation Calculus Specifications for Event Calculus Logic Programs , 1995, LPNMR.

[7]  Gerd Wagner,et al.  Logic Programming with Strong Negation , 1989, ELP.

[8]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[9]  Jos,et al.  Concurrent Actions and Changes in the Situation Calculus Jos , 1994 .

[10]  Chitta Baral,et al.  Representing Actions: Laws, Observations and Hypotheses , 1997, J. Log. Program..

[11]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

[12]  R. Reiter,et al.  Nonmonotonic reasoning in the framework of situation calculus , 1992 .

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

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

[15]  Fangzhen Lin,et al.  Concurrent Actions in the Situation Calculus , 1992, AAAI.

[16]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.

[17]  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.

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

[19]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[20]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[21]  Fangzhen Lin,et al.  How to Progress a Database II: The STRIPS Connection , 1995, IJCAI.

[22]  Fangzhen Lin,et al.  Provably correct theories of action , 1991, JACM.

[23]  Michael Thielscher,et al.  Actions and Specificity , 1993, ILPS.

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

[25]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[26]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[27]  Robert S. Boyer,et al.  Automated Reasoning: Essays in Honor of Woody Bledsoe , 1991, Automated Reasoning.

[28]  Fangzhen Lin,et al.  How to Progress a Database (and Why) I. Logical Foundations , 1994, KR.

[29]  David H. D. Warren,et al.  Logic Programming, Proceedings of the Seventh International Conference, Jerusalem, Israel, June 18-20, 1990 , 1990, ICLP.

[30]  Richard Watson,et al.  An inference engine for epistemic specifications , 1994 .

[31]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[32]  Erik Sandewall,et al.  The Range of Applicability of Some Non-monotonic Logics for Strict Inertia , 1994, J. Log. Comput..

[33]  Luigi Palopoli,et al.  Reasoning with Minimal Models: Efficient Algorithms and Applications. , 1994, KR 1994.

[34]  Giorgio Levi,et al.  Logic Programming, Proceedings of the Sixth International Conference, Lisbon, Portugal, June 19-23, 1989 , 1989, ICLP.

[35]  José Júlio Alferes,et al.  Classical Negation in Logic Programs , 1990 .

[36]  John McCarthy,et al.  Programs with common sense , 1960 .

[37]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

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

[39]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

[40]  Hudson Turner,et al.  Signed Logic Programs , 1994, ILPS.

[41]  Vladimir Lifschitz,et al.  From Disjunctive Programs to Abduction , 1994, NMELP.

[42]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[43]  David S. Warren,et al.  Representing actions in logic programming and its applications in database updates , 1993 .

[44]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[45]  Phan Minh Dung,et al.  Representing Actions in Logic Programming and Its Applications in Database Updates , 1993, ICLP.

[46]  Raymond Reiter,et al.  Proving Properties of States in the Situation Calculus , 1993, Artif. Intell..

[47]  V. Lifschitz,et al.  Actions with Indirect Eeects (preliminary Report) , 1994 .

[48]  Toby Walsh,et al.  Proceedings of AAAI-96 , 1996 .

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

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

[51]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[52]  Danny De Schreye,et al.  Representing Incomplete Knowledge in Abductive Logic Programming , 1993, J. Log. Comput..

[53]  Michael Thielscher,et al.  An analysis of systematic approaches to reasoning about actions and change , 1995 .