2002/02/18 by Daniel Lehmann, Menachem Magidor, Karl Schlechta
Computer Science · #cs.AI
published as Journal of Symbolic Logic, Vol. 66 No.1 (March 2001) pp. 295-317 · Preliminary version presented at TARK '96
arxiv created 2002/02/18 · arxiv updated 2009/11/30
A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula a as the theory defined by the set of all those models of a that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates describe properties of iterated revisions.