Comparative Assessment of Update Methods Using Static Domain Constraints

The paper analyzes and compares methods for ramiication, or for update, which are based on minimization of change while respecting static domain constraints. We analyze how the choice of minimization strategy aaects the set of preferred new states. Besides the classical case of straight minimization, we analyze alternative cases where state variables ((uents) are partitioned into two or three kinds, such as occluded/unoccluded, persistent/nonpersistent, frame/nonframe, or released/nonreleased, and where minimization treats changes in these categories diierently. This includes the methods previously proposed by del Val and Shoham, and by Kartha and Lifschitz. We also discuss and analyze an additional technique, called changeset-partitioning, where minimization is done separately for each outcome of a nondeter-ministic action. We relate it to the previous methods, and argue that this new method is generally to be preferred over them.

[1]  Choong-ho Yi Reasoning about Concurrent Actions in the Trajectory Semantics , 1995 .

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

[3]  Hirofumi Katsuno,et al.  A Unified View of Propositional Knowledge Base Updates , 1989, IJCAI.

[4]  Michael Thielscher Computing Ramiications by Postprocessing , 1995 .

[5]  Erik Sandewall Systematic Comparison of Approaches to Ramiication Using Restricted Minimization of Change , 1995 .

[6]  Marie-Odile Cordier,et al.  Prioritized Transitions for Updates , 1994, KI.

[7]  Yoav Shoham,et al.  Deriving properties of belief update from theories of action , 1992, IJCAI.

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

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

[10]  Erik Sandewall Features and fluents : representation of knowledge about dynamical systems , 1994 .

[11]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[12]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[13]  Marie-Odile Cordier,et al.  A temporal revision model for reasoning about world change , 1994, Int. J. Intell. Syst..

[14]  Erik Sandewall,et al.  Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds , 1989, IJCAI.

[15]  Erik Sandewall Reasoning about Actions and Change with Ramification , 1995, Computer Science Today.

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

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

[18]  Erik Sandewall,et al.  The Range of Applicability of Nonmonotonic Logics for the Inertia Problem , 1993, IJCAI.