This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...) in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set. (shrink)

A set of sentential revision operations can be generated in a select-direct way within a new framework for belief change named descriptor revision firstly introduced in Hansson [8]. In this paper, we adopt another constructive approach to these operations, based on a relation \ on sentences named believability relation. Intuitively, \ means that the subject is at least as prone to believe or accept \ as to believe or accept \. We demonstrate that so called H-believability relations and basic believability (...) relations, the second of which the is axiomatically characterized with a set of weak postulates, are faithful alternative models for two typical select-direct sentential revision operations. Then we investigate additional postulates on believability relations that correlate with properties of the generated revision operations. Finally, we show that traditional AGM revision operations can be reconstructed from a strengthened variant of the basic believability relation and there is a close connection between this relation and the standard epistemic entrenchment relation. (shrink)

Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.

This paper presents the model of ‘bounded revision’ that is based on two-dimensional revision functions taking as arguments pairs consisting of an input sentence and a reference sentence. The key idea is that the input sentence is accepted as far as (and just a little further than) the reference sentence is ‘cotenable’ with it. Bounded revision satisfies the AGM axioms as well as the Same Beliefs Condition (SBC) saying that the set of beliefs accepted after the revision does not depend (...) on the reference sentence (although the posterior belief state does depend on it). Bounded revision satisfies the Darwiche–Pearl (DP) axioms for iterated belief change. If the reference sentence is fixed to be a tautology or a contradiction, two well-known one-dimensional revision operations result. Bounded revision thus naturally fills the space between conservative revision (also known as natural revision) and moderate revision (also known as lexicographic revision). I compare this approach to the two-dimensional model of ‘revision by comparison’ investigated by Fermé and Rott (Artif Intell 157:5–47, 2004 ) that satisfies neither the SBC nor the DP axioms. I conclude that two-dimensional revision operations add substantially to the expressive power of qualitative approaches that do not make use of numbers as measures of degrees of belief. (shrink)

This paper addresses the question whether the past couple of decades of formal research in belief revision offers evidence of a new psychologism in logic. In the first part I examine five potential arguments in favour of this thesis and find them all wanting. In the second part of the paper I argue that belief revision research has climbed up a hierarchy of models for the change of doxastic states that appear to be clearly normative at the bottom, but are (...) more amenable to an empirical-descriptive interpretation on higher levels. I conclude that this observation might offer a foothold for the thesis that there is a new psychologism in logic. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

Belief revision theory studies how an ideal doxastic agent should revise her beliefs when she receives new information. In part I I will first present the AGM theory of belief revision (Alchourrón & Gärdenfors & Makinson 1985). Then I will focus on the problem of iterated belief revisions.

A new formal model of belief dynamics is proposed, in which the epistemic agent has both probabilistic beliefs and full beliefs. The agent has full belief in a proposition if and only if she considers the probability that it is false to be so close to zero that she chooses to disregard that probability. She treats such a proposition as having the probability 1, but, importantly, she is still willing and able to revise that probability assignment if she receives information (...) that gives her sufficient reasons to do so. Such a proposition is undoubted, but not undoubtable. In the formal model it is assigned a probability 1 − δ, where δ is an infinitesimal number. The proposed model employs probabilistic belief states that contain several underlying probability functions representing alternative probabilistic states of the world. Furthermore, a distinction is made between update and revision, in the same way as in the literature on belief change. The formal properties of the model are investigated, including properties relevant for learning from experience. The set of propositions whose probabilities are infinitesimally close to 1 forms a belief set. Operations that change the probabilistic belief state give rise to changes in this belief set, which have much in common with traditional operations of belief change. (shrink)

We introduce a constructive model of selective belief revision in which it is possible to accept only a part of the input information. A selective revision operator ο is defined by the equality K ο α = K * f(α), where * is an AGM revision operator and f a function, typically with the property ⊢ α → f(α). Axiomatic characterizations are provided for three variants of selective revision.

Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or “corpora” of data and beliefs. Early models have dealt with unconditional acceptance and integration of potentially belief-contravening pieces of information into the existing corpus. More recently, models of “non-prioritized” revision were proposed that allow the agent rationally to refuse to accept the new information. This paper introduces a refined method for changing beliefs by specifying constraints on the relative plausibility of (...) propositions. Like the earlier belief revision models, the method proposed is a qualitative one, in the sense that no numbers are needed in order to specify the posterior plausibility of the new information. We use reference beliefs in order to determine the degree of entrenchment of the newly accepted piece of information. We provide two kinds of semantics for this idea, give a logical characterization of the new model, study its relation with other operations of belief revision and contraction, and discuss its intuitive strengths and weaknesses. (shrink)

The 1985 paper by Carlos Alchourrón (1931–1996), Peter Gärdenfors, and David Makinson (AGM), "On the Logic of Theory Change: Partial Meet Contraction and Revision Functions" was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twentyfive years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in (...) the original framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

The 1985 paper by Carlos Alchourrón, Peter Gärdenfors, and David Makinson, “On the Logic of Theory Change: Partial Meet Contraction and Revision Functions” was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twenty-five years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in the original (...) framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

The contributions to the Special Issue on Multiple Belief Change, Iterated Belief Change and Preference Aggregation are divided into three parts. Four contributions are grouped under the heading "multiple belief change" (Part I, with authors M. Falappa, E. Fermé, G. Kern-Isberner, P. Peppas, M. Reis, and G. Simari), five contributions under the heading "iterated belief change" (Part II, with authors G. Bonanno, S.O. Hansson, A. Nayak, M. Orgun, R. Ramachandran, H. Rott, and E. Weydert). These papers do not only pick (...) up the particular questions raised, but also extend and modify the framework of Alchourrón, Gärdenfors and Makinson. Part III deals with preference aggregation and consists of one contribution (by F. Herzberg and D. Eckert). (shrink)

Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...

This thesis investigates a sort of non-prioritized multiple revision, the operation of making up one's mind, and its generalization, the operation of choice revision. Making up one's mind about a sentence is a belief change that takes the agent to a belief state in which either the sentence or its negation is believed. In choice revision, the input information is represented by a set of sentences, and the agent should make a choice on which sentences to be accepted. Apart from (...) being practically important, these operations are technically interesting since the standard approach of intersecting a set of optimal outcomes is not workable. Paper I provides a construction based on descriptor revision in which the operation of making up one's mind can be modelled in a ``select-direct'' way, which is different from the traditional ``select-and-intersect'' methodology employed in the AGM model. The article shows that this construction is axiomatically characterized with a set of plausible postulates, and investigates the additional postulates that correlate with properties of the construction. Paper II investigates a new modelling for sentential belief revision operations, which is based on a set of relations on sentences named believability relations. It demonstrates that two special kinds of such relations, i.e. H-believability relations and basic believability relations, are faithful alternative models of two typical sentential revision generated from descriptor revision. It also shows that traditional AGM revision operations can be reconstructed from a strengthened variant of the basic believability relation and there exists a close connection between this strengthened believability relation and the standard epistemic entrenchment relation. Paper III studies the constructions of choice revision based on descriptor revision and multiple believability relations, which extends the domain of believability relations from sentences to sets of sentences. It is shown that each of two variants of choice revision based on descriptor revision is axiomatically characterized with a set of plausible postulates, assuming that the object language is finite. Furthermore, without assuming a finite language, it is shown that choice revision constructed from multiple believability relations is axiomatically characterized with the same sets of postulates proposed for choice revision derived from descriptor revision, whenever these relations satisfy certain rationality conditions. Paper IV explores choice revision on belief bases. A generalized version of expansion operation called partial expansion is introduced for developing models of this kind of choice revision. Based on the partial expansion as well as two multiple contraction operations from the literature, two kinds of choice revision operators on belief bases are constructed. This paper proposes several postulates for such two operators and shows that they can be axiomatically characterized by such postulates. Furthermore, it investigates two kinds of making up one's mind operators generated from these two choice revision operators and presents the axiomatic characterizations of them. (shrink)