Explaining updates by minimal sums

Human reasoning about developments of the world involves always an assumption of inertia. We discuss two approaches for formalizing such an assumption, based on the concept of an explanation: (1) there is a general preference relation given on the set of all explanations and (2) there is a notion of a distance between models and explanations are preferred if their sum of distances is minimal. Each distance dist naturally induces a preference relation dist. We show exactly under which conditions the converse is true as well and therefore both approaches are equivalent modulo these conditions. Our main result is a general representation theorem in the spirit of Kraus, Lehmann and Magidor. Copyright 2001 Elsevier Science B.V.

[1]  Shai Berger,et al.  Preferred History Semantics for Iterated Updates , 1999, J. Log. Comput..

[2]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[3]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[4]  Vladimir Lifschitz,et al.  A Simple Formalization of Actions Using Circumscription , 1995, IJCAI.

[5]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[6]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

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

[8]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[9]  Marianne Winslett Sometimes Updates Are Circumscription , 1989, IJCAI.

[10]  Jürgen Dix,et al.  Nonmonotonic Reasoning: An Overview , 1997, CSLI Lecture Notes.

[11]  J. Farkas Theorie der einfachen Ungleichungen. , 1902 .

[12]  K. Hensel Journal für die reine und angewandte Mathematik , 1892 .

[13]  Norman Y. Foo,et al.  Reasoning About Persistence: A Theory of Actions , 1993, IJCAI.

[14]  Karl Schlechta Preferential Choice Representation Theorems for Branching Time Structures , 1995, J. Log. Comput..

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

[16]  Karl Schlechta,et al.  Distance semantics for belief revision , 1996, Journal of Symbolic Logic.