C.S. Peirce's and Isaac Levi's accounts of the belief-doubt-belief model are discussed and evaluated. It is argued that the contemporary study of belief change has metamorphosed into a branch of philosophical logic where empirical considerations have become obsolete. A case is made for reformulations of belief change systems that do allow for empirical tests. Last, a belief change system is presented that (1) uses finite representations of information, (2) can adequately deal with inconsistencies, (3) has finite operations of change, (4) (...) can do without extra-logical elements, and (5) only licenses consistent beliefs. (shrink)

By means of an example, shows the possibility of beliefs that are separately rational whilst together inconsistent.

The temporal updating of an agent’s beliefs in response to a flow of information is modeled in a simple modal logic that, for every date t, contains a normal belief operator B t and a non-normal information operator I t which is analogous to the ‘only knowing’ operator discussed in the computer science literature. Soundness and completeness of the logic are proved and the relationship between the proposed logic, the AGM theory of belief revision and the notion of plausibility is (...) discussed. (shrink)

We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be (...) faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction. (shrink)

Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather (...) than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector. (shrink)

The literature on the theory of social choice has grown considerably beyond the few items in existence at the time the first edition of this book appeared in 1951. Some of the new literature has dealt with the technical, mathematical aspects, more with the interpretive. My own thinking has also evolved somewhat, although I remain far from satisfied with present formulations. The exhaustion of the first edition provides a convenient time for a selective and personal stocktaking in the form of (...) an appended commentary entitled, 'Notes on the Theory of Social Choice, 1963, ' containing reflections on the text and its omissions and on some of the more recent literature. This form has seemed more appropriate than a revision of the original text, which has to some extent acquired a life of its own. (shrink)

Belief merging aims at combining several pieces of information coming from different sources. In this paper we review the works on belief merging of propositional bases. We discuss the relationship between merging, revision, update and confluence, and some links between belief merging and social choice theory. Finally we mention the main generalizations of these works in other logical frameworks.

ABSTRACT We consider in this work the problem of iterated belief revision. We propose a family of belief revision operators called revision with memory operators and we give a logical (both syntactical and semantical) characterization of these operators. They obey what we call the principle of strong primacy of update: when one revises his beliefs by a new evidence, then all possible worlds that satisfy this new evidence become more reliable than those that do not. We show that those operators (...) have a satisfying behaviour concerning the iteration of the revision process. Then we provide four particular operators of this family. (shrink)

This major work challenges some widely held positions in epistemology - those of Peirce and Popper on the one hand and those of Quine and Kuhn on the other.

We discuss various possibilities for developing a dynamic doxastic logic (DDL) for introspective agents: agents who have the ability to form higher-order beliefs. Such agents can reflect upon and change their minds about their own beliefs. The project of constructing such a logic, full DDL or DDL unlimited, is ridden with difficulties due to the fact that the agent's own doxastic state now becomes a part of the reality he is trying to explore. When an introspective agent learns more about (...) the world (and himself), the reality he holds beliefs about undergoes a change in its doxastic part, which means that his introspective beliefs have to be adjusted accordingly. (shrink)

In earlier papers (Lindström & Rabinowicz, 1989. 1990), we proposed a generalization of the AGM approach to belief revision. Our proposal was to view belief revision as a relation rather thanas a function on theories (or belief sets). The idea was to allow for there being several equally reasonable revisions of a theory with a given proposition. In the present paper, we show that the relational approach is the natural result of generalizing in a certain way an approach to belief (...) revision due to Adam Grove. In his (1988) paper, Grove presents two closely related modelings of functional belief revision, one in terms of a family of "spheres" around the agent's theory G and the other in terms of an epistemic entrenchment ordering of propositions. The "sphere"-terminology is natural when one looks upon theories and propositions as being represented by sets of possible worlds. Grove's spheres may be thought of as possible "fallback" theories relative to the agent's original theory: theories that he may reach by deleting propositions that are not "sufficiently" entrenched (according to standards of sufficient entrenchment of varying stringency). To put it differently, fallbacks are theories that are closed upwards under entrenchment The entrenchment ordering can be recovered from the family of fallbacks by the definition: A is at least as entrenched as B iff A belongs to every fallback to which B belongs. To revise a theory T with a proposition A, we go to the smallest sphere that contain A-worlds and intersect it with A. The relational notion of belief revision that we are interested in, results from weakening epistemic entrenchment by not assuming it to be connected. I.e., we want to allow that some propositions may be incomparable with respect to epistemic entrenchment. As a result, the family of fallbacks around a given theory will no longer have to be nested. This change opens up the possibility for several different ways of revising a theory with a given proposition. (shrink)

The AGM paradigm for belief revision provides a very elegant and powerful framework for reasoning about idealized agents. The paradigm assumes that the modeled agent is a perfect reasoner with infinite memory. In this paper we propose a framework to reason about non-ideal agents that generalizes the AGM paradigm. We first introduce a structure to represent an agent's belief states that distinguishes different status of beliefs according to whether or not they are explicitly represented, whether they are currently active and (...) whether they are fully accepted or provisional. Then we define a set of basic operations that change the status of beliefs and show how these operations can be used to model agents with different capacities. We also show how different operations of belief change described in the literature can be seen as special cases of our theory. (shrink)

In this paper it is argued that, in order to solve the problem of iterated belief change, both the belief state and its input should be represented as epistemic entrenchment (EE) relations. A belief revision operation is constructed that updates a given EE relation to a new one in light of an evidential EE relation. It is shown that the operation in question satisfies generalized versions of the Gärdenfors revision postulates. The account offered is motivated by Spohn's ordinal conditionalization functions, (...) and can be seen as the Jeffrization of a proposal considered by Rott. (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within a formal logical (...) language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

In ‘belief revision’ a theory is revised with a formula φ resulting in a revised theory . Typically, is in , one has to give up belief in by a process of retraction, and φ is in . We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory wherein the agent believes the negation of the revision formula, i.e., wherein is true. The revision with (...) φ is a program *φ that transforms this information state into a new information state. The transformation is described by a dynamic modal operator [*φ], that is interpreted as a binary relation [ [*φ] ] between information states. The next information state is computed from the current information state and the belief revision formula. If the revision is successful, the agent believes φ in the resulting state, i.e., Bφ is then true. To make this work, as information states we propose ‘doxastic epistemic models’ that represent both knowledge and degrees of belief. These are multi-modal and multi-agent Kripke models. They are constructed from preference relations for agents, and they satisfy various characterizable multi-agent frame properties. Iterated, revocable, and higher-order belief revision are all quite natural in this setting. We present, for an example, five different ways of such dynamic belief revision. One can also see that as a non-deterministic epistemic action with two alternatives, where one is preferred over the other, and there is a natural generalization to general epistemic actions with preferences. (shrink)

Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general method that solves certain (...) kind of problems involving public communications—among them well known puzzles of Muddy Children and Mr. Sum & Mr. Product. As the paper gives a formal logical treatment of the operation of restriction of the universe of a Kripke model, it contributes also to investigations of semantics for modal logics. (shrink)

Five types of constructions are introduced for non-prioritized belief revision, i.e., belief revision in which the input sentence is not always accepted. These constructions include generalizations of entrenchment-based and sphere-based revision. Axiomatic characterizations are provided, and close interconnections are shown to hold between the different constructions.

The most controversial condition that the AGM theory of rational belief change places on belief contraction is the recovery condition. The condition is controversial because of a series of putative counterexamples due (separately) to I. Levi and S. O. Hansson. In this paper we show that the conflicts that Levi and Hansson arrange between AGM contraction and our intuitions about how to give up beliefs are merely apparent. We argue that these conflicts disappear once we attend more closely to the (...) identification of the beliefs contracted away in each counterexample case. Since, on our view, speakers" belief contraction intentions are often more complicated than they may first appear, we are led to develop apparatus for thinking about the communication and identification of those intentions. Our argument refocuses attention on the difficult question of how to apply the AGM theory to particular cases. (shrink)

We examine carefully the rationale underlying the approaches to belief change taken in the literature, and highlight what we view as methodological problems. We argue that to study belief change carefully, we must be quite explicit about the ontology or scenario underlying the belief change process. This is something that has been missing in previous work, with its focus on postulates. Our analysis shows that we must pay particular attention to two issues that have often been taken for granted: the (...) first is how we model the agent's epistemic state. (Do we use a set of beliefs, or a richer structure, such as an ordering on worlds? And if we use a set of beliefs, in what language are these beliefs are expressed?) We show that even postulates that have been called beyond controversy are unreasonable when the agent's beliefs include beliefs about her own epistemic state as well as the external world. The second is the status of observations. (Are observations known to be true, or just believed? In the latter case, how firm is the belief?) Issues regarding the status of observations arise particularly when we consider iterated belief revision, and we must confront the possibility of revising by and then by ¬. (shrink)

Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic provides an axiomatic characterization of the (...) full set of AGM postulates. © 2006 Elsevier B.V. All rights reserved. (shrink)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

The thirty-five chapters in this book describe various judgmental heuristics and the biases they produce, not only in laboratory experiments but in important...

In this article we strive to provide a detailed and principled analysis of the role of beliefs in goal processing—that is, the cognitive transition that leads from a mere desire to a proper intention. The resulting model of belief-based goal processing has also relevant consequences for the analysis of intentions, and constitutes the necessary core of a constructive theory of intentions, i.e. a framework that not only analyzes what an intention is, but also explains how it becomes what it is. (...) We discuss similarities and differences between our approach and other standard accounts of intention, in particular Bratman’s planning theory. The aim here is to question and refine the conceptual foundations of many theories of intentional action: as a consequence, although our analysis is not formal in itself, it is ultimately meant to have deep consequences for formal models of intentional agency. (shrink)

We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the single-agent case, based on the notion of interpretation, to the multi-agent case. Then we show that, thanks to the shape of our new semantics, all the results of the AGM framework transfer. Afterwards we investigate some postulates that are specific to our multi-agent setting. Finally, we give an example of revision operator that fulfills one of these new postulates and give (...) an example of revision on a concrete example. (shrink)

In this paper we consider the relation between beliefs and goals in agent theory. Beliefs play three roles in reasoning about goals: they play a role in the generation of unconditional desires from conditional ones, they play a role in adoption of desires as goals, and they play a role in the selection of plans to achieve goals. In this paper we consider the role of goals in reasoning about beliefs. Though we assume that goals do not play a role (...) in the belief generation problem, we argue that they play a role in the belief selection problem. We show the rationality of the use of goals in belief selection, in the sense that there are cases in which agents that take their goals into account in selecting a belief set from a set of alternatives outperform agents that do not do so. We also formally distinguish between the rational role of goals in belief selection and irrational wishful thinking. (shrink)

Examines the link between nonmonotonic inference relations and theory revision operations, focusing on the correspondence between abstract properties which each may satisfy.

This paper combines various structures representing degrees of belief, degrees of disbelief, and degrees of non-belief (degrees of expectations) into a unified whole. The representation uses relations of comparative necessity and possibility, as well as non-probabilistic functions assigning numerical values of necessity and possibility. We define all-encompassing necessity structures which have weak expectations (mere hypotheses, guesses, conjectures, etc.) occupying the lowest ranks and very strong, ineradicable ('a priori') beliefs occupying the highest ranks. Structurally, there are no differences from the top (...) to the bottom. I argue that belief is a vague notion, and that thresholds for belief, if there are any, are context-dependent. (shrink)

ABSTRACT The major approaches to belief revision and non monotonic reasoning proposed in the literature differ along a number of dimensions, including whether they are ?syntax- based? or ?semantic-based?, ?foundational? or ?coherentist?, ?consistence-restoring? or ?inconsistency-tolerant?. Our contribution towards clarifying the connections between these various approaches is threefold: ?We show that the two main approaches to belief revision, the foundations and coherence theories, are mathematically equivalent, thus answering a question left open in [Gar90, Doy92], The distinction between syntax-based approaches to revision (...) and approaches based on (semantic) preferential structures falls along similar lines, and their expressive equivalence is a consequence of this result. ?We formally clarify the connection between belief revision and non monotonic reasoning, in a particularly simple way which also throws light on the connection between consistence- restoring and reasoning-from-inconsistency approaches [BDP95]. ?As a direct application of the above, we show that Poole's (syntax-based) system of default reasoning and Shoham's preferential semantic for non monotonic reasoning are also expressively equivalent, in that they can represent the same set of non monotonic consequence relations. (shrink)

In the logic of theory change, the standard model is AGM, proposed by Alchourrón et al. (J Symb Log 50:510–530, 1985 ). This paper focuses on the extension of AGM that accounts for contractions of a theory by a set of sentences instead of only by a single sentence. Hansson (Theoria 55:114–132, 1989 ), Fuhrmann and Hansson (J Logic Lang Inf 3:39–74, 1994 ) generalized Partial Meet Contraction to the case of contractions by (possibly non-singleton) sets of sentences. In this (...) paper we present the possible worlds semantics for partial meet multiple contractions. (shrink)

Consider a rational agent X at certain point of time t. X's epistemic state can be represented in different ways.

Develops a concept of revision, akin in spirit to AGM partial meet revision, but in which the postulate of 'success' may fail. The basic idea is to see such an operation as composite, with a pre-processor using a priori considerations to resolve the question of whether to revise, following which another operation revises in a manner that protects the a priori material.

In this paper, it is argued that both the belief state and its input should be represented as epistemic entrenchment (EE) relations. A belief revision operation is constructed that updates a given EE relation to a new one in light of an evidential EE relation, and an axiomatic characterization of this operation is given. Unlike most belief revision operations, the one developed here can handle both multiple belief revision and iterated belief revision.