Preferential belief change using generalized epistemic entrenchment

A sentence A is epistemically less entrenched in a belief state K than a sentence B if and only if a person in belief state K who is forced to give up either A or B will give up A and hold on to B. This is the fundamental idea of epistemic entrenchment as introduced by Gärdenfors (1988) and elaborated by Gärdenfors and Makinson (1988). Another distinguishing feature of relations of epistemic entrenchment is that they permit particularly simple and elegant construction recipes for minimal changes of belief states. These relations, however, are required to satisfy rather demanding conditions. In the present paper we liberalize the concept of epistemic entrenchment by removing connectivity, minimality and maximality conditions. Correspondingly, we achieve a liberalization of the concept of rational belief change that does no longer presuppose the postulates of success and rational monotony. We show that the central results of Gärdenfors and Makinson are preserved in our more flexible setting. Moreover, the generalized concept of epistemic entrenchment turns out to be applicable also to relational and iterated belief changes.

[1]  Wlodzimierz Rabinowicz,et al.  Epistemic entrenchment with incomparabilities and relational belief revision , 1989, The Logic of Theory Change.

[2]  David Makinson,et al.  General Theory of Cumulative Inference , 1988, NMR.

[3]  H. Rott On the Logic of Theory Change: More Maps Between Different Kinds of Contraction Function , 1992 .

[4]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

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

[6]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[7]  A. Sen,et al.  Choice, Welfare and Measurement , 1982 .

[8]  Bernhard Nebel,et al.  A Knowledge Level Analysis of Belief Revision , 1989, KR.

[9]  David Lewis,et al.  Ordering semantics and premise semantics for counterfactuals , 1981, J. Philos. Log..

[10]  Peter Gärdenfors,et al.  Revisions of Knowledge Systems Using Epistemic Entrenchment , 1988, TARK.

[11]  Frank Veltman Prejudices, presuppositions, and the theory of counterfactuals , 1976 .

[12]  H. Herzberger,et al.  Ordinal Preference and Rational Choice , 1973 .

[13]  Hans Rott,et al.  Is it Impossible to Keep up to Date? , 1990, Nonmonotonic and Inductive Logic.

[14]  David Makinson,et al.  Maps between some different kinds of contraction function: The finite case , 1986, Stud Logica.

[15]  Angelika Kratzer,et al.  Partition and revision: The semantics of counterfactuals , 1981, J. Philos. Log..

[16]  David Makinson,et al.  On the logic of theory change: Safe contraction , 1985, Stud Logica.

[17]  Hans Rott,et al.  A nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals , 1989, The Logic of Theory Change.

[18]  Hans Rott,et al.  Two methods of constructing contractions and revisions of knowledge systems , 1991, J. Philos. Log..

[19]  Peter Gärdenfors,et al.  Relations between the logic of theory change and nonmonotonic logic , 1989, The Logic of Theory Change.

[20]  Daniel Lehmann,et al.  What does a Conditional Knowledge Base Entail? , 1989, Artif. Intell..