Reasoning About Actions: Steady Versus Stabilizing State Constraints

Abstract In formal approaches to commonsense reasoning about actions, the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state constraints. We pursue a new distinction between two kinds of state constraints which will be proved crucially important for solving the general Ramification Problem. Steady constraints never, not even for an instant, cease being in force. As such they give rise to truly instantaneous indirect effects of actions. Stabilizing state constraints, on the other hand, may be suspended for a short period of time after an action has occurred. Indirect effects deriving from these constraints materialize with a short lag. This hitherto neglected distinction is shown to have essential impact on the Ramification Problem: if stabilizing state constraints interact, then approaches not based on so-called causal propagation prove defective. But causal propagation, too, is shown to risk producing anomalous models, in case steady and stabilizing indirect effects are propagated indiscriminately. Motivated by these two observations, we improve the theory of causal relationships and its Fluent Calculus axiomatization, which both are methods of causal propagation, so as to properly handle the distinction between steady and stabilizing constraints.

[1]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[2]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[3]  Edwin P. D. Pednault,et al.  FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .

[4]  Fangzhen Lin,et al.  State Constraints Revisited , 1994, J. Log. Comput..

[5]  Donald Michie,et al.  Machine Intelligence 4 , 1970 .

[6]  Charles Elkan,et al.  Reasoning about Action in First-Order Logic , 1992 .

[7]  Michael J. Maher,et al.  A Theory of Complete Logic Programs with Equality , 1984, J. Log. Program..

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

[9]  Michael Thielscher,et al.  Explicit and Implicit Indeterminism: Reasoning About Uncertain and Contradictory Specifications of Dynamic Systems , 1997, J. Log. Program..

[10]  Vladimir Lifschitz,et al.  Frames in the Space of Situations , 1990, Artif. Intell..

[11]  Michael Thielscher,et al.  Towards State Update Axioms: Reifying Successor State Axioms , 1998, JELIA.

[12]  Murray Shanahan Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[13]  Antonis C. Kakas,et al.  Reasoning about Actions, Narratives and Ramification , 1997, Electron. Trans. Artif. Intell..

[14]  Matthew L. Ginsberg,et al.  Reasoning About Action II: The Qualification Problem , 1987 .

[15]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[16]  Erik Sandewall,et al.  Assessments of Ramification Methods that Use Static Domain Constraints , 1996, International Conference on Principles of Knowledge Representation and Reasoning.

[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]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

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

[20]  Daniel Leivant,et al.  Higher order logic , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[21]  H. Turner,et al.  A Causal Theory of Ramifications and Qualifications (Extended Abstract) , 1995 .

[22]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

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