Reasoning about action and change

Reasoning about change is a central issue in research on human and robot planning. We study an approach to reasoning about action and change in a dynamic logic setting and provide a solution to problems which are related to the Frame problem. Unlike most work on the frame problem the logic described in this paper is monotonic. It (implicitly) allows for the occurrence of actions of multiple agents by introducing non-stationary notions of waiting and test. The need to state a large number of “frame axioms” is alleviated by introducing a concept of chronological preservation to dynamic logic. As a side effect, this concept permits the encoding of temporal properties in a natural way. We compare the relative merits of our approach and non-monotonic approaches as regards different aspects of the frame problem. Technically, we show that the resulting extended systems of propositional dynamic logic preserve (weak) completeness, finite model property and decidability.

[1]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[2]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[3]  Sarit Kraus,et al.  Nonmonotonicity and the Scope of Reasoning , 1991, Artif. Intell..

[4]  Krister Segerberg,et al.  Applying modal logic , 1980 .

[5]  Murray Shanahan,et al.  Narratives in the Situation Calculus , 1994, J. Log. Comput..

[6]  V. Lifschitz.  Formal theories of action , 1987 .

[7]  Vaughan R. Pratt.  A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[8]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[9]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

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

[11]  George Gargov,et al.  A Note on Boolean Modal Logic , 1990 .

[12]  K. Segerberg.  A completeness theorem in the modal logic of programs , 1982 .

[13]  Hirofumi Katsuno,et al.  Propositional Knowledge Base Revision and Minimal Change , 1991, Artif. Intell..

[14]  Tinko Tinchev,et al.  Modal Environment for Boolean Speculations , 1987 .

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

[16]  Butler W. Lampson,et al.  Annual Review of Computer Science , 1986 .

[17]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[18]  C. D. Walter.  Algorithmics–The spirit of computing , 1988 .

[19]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[20]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..

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

[22]  Peter Gärdenfors,et al.  Planning from first principles , 1992 .

[23]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

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

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

[26]  David Makinson,et al.  Five faces of minimality , 1993, Stud Logica.

[27]  Richard Waldinger,et al.  Achieving several goals simultaneously , 1977 .

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

[29]  Y. Shoham.  Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .

[30]  Vaughan R. Pratt,et al.  Application of modal logic to programming , 1980 .

[31]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

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

[33]  Max J. Cresswell,et al.  A companion to modal logic , 1984 .

[34]  J. M. Larrazabal,et al.  Reasoning about change , 1991 .

[35]  B. LassenBRICS.  Reasoning with Actions , 2022 .

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

[37]  Susanne Biundo-Stephan,et al.  A New Logical framework for Deductive Planning , 1993, IJCAI.

[38]  Michael Georgeff,et al.  MANY AGENTS ARE BETTER THAN ONE , 1987 .

[39]  Gerhard Schurz,et al.  Probabilistic Justification of Default Reasoning , 1994, KI.

[40]  Matthew L. Ginsberg,et al.  Computational Considerations in Reasoning about Action , 1991, KR.

[41]  David Harel,et al.  Process logic: Expressiveness, decidability, completeness , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).