In the companion paper (Towards a “sophisticated” model of belief dynamics. Part I), a general framework for realistic modelling of instantaneous states of belief and of the operations involving them was presented and motivated. In this paper, the framework is applied to the case of belief revision. A model of belief revision shall be obtained which, firstly, recovers the Gärdenfors postulates in a well-specified, natural yet simple class of particular circumstances; secondly, can accommodate iterated revisions, recovering several proposed revision operators (...) for iterated revision as special cases; and finally, offers an analysis of Rott’s recent counterexample to several Gärdenfors postulates [32], elucidating in what sense it fails to be one of the special cases to which these postulates apply. (shrink)

This article is concerned with the representation of preferences which do not satisfy the ordinary axioms for state-independent utilities. After suggesting reasons for not being satisfied with solutions involving state-dependent utilities, an alternative representation shall be proposed involving state-independent utilities and a situation-dependent factor. The latter captures the interdependencies between states and consequences. Two sets of axioms are proposed, each permitting the derivation of subjective probabilities, state-independent utilities, and a situation-dependent factor, and each operating in a different framework. The first (...) framework involves the concept of a decision situation—consisting of a set of states, a set of consequences and a preference relation on acts; the probabilities, utilities and situation-dependent factor are elicited by referring to other, appropriate decision situations. The second framework, which is technically related, operates in a fixed decision situation; particular “subsituations” are employed in the derivation of the representation. Possible interpretations of the situation-dependent factor and the notion of situation are discussed. (shrink)

In recent years there has been a growing consensus that ordinary reasoning does not conform to the laws of classical logic, but is rather nonmonotonic in the sense that conclusions previously drawn may well be removed upon acquiring further information. Even so, rational belief formation has up to now been modelled as conforming to some fundamental principles that are classically valid. The counterexample described in this paper suggests that a number of the most cherished of these principles should not be (...) regarded as valid for commonsense reasoning. An explanation of this puzzling failure is given, arguing that a problem in the theory of rational choice transfers to the realm of belief formation. (shrink)

The abstract structure of inquiry - the process of acquiring and changing beliefs about the world - is the focus of this book which takes the position that the "pragmatic" rather than the "linguistic" approach better solves the philosophical problems about the nature of mental representation, and better accounts for the phenomena of thought and speech. It discusses propositions and propositional attitudes (the cluster of activities that constitute inquiry) in general and takes up the way beliefs change in response to (...) potential new information, suggesting that conditional propositions should be understood as projections of epistemic policies onto the world.Robert C. Stalnaker is a professor in the Sage School of Philosophy at Cornell University. A Bradford Book. (shrink)

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs.

We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...) an epistemic program is what we call aprogram model. This is a Kripke model of ‘actions’,representing the agents' uncertainty about the current action in a similar way that Kripke models of ‘states’ are commonly used in epistemic logic to represent the agents' uncertainty about the current state of the system. Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates. Formally, an update consists of two operations: the first is called the update map, and it takes every state model to another state model, called the updated model; the second gives, for each input state model, a transition relation between the states of that model and the states of the updated model. Each variety of epistemic actions, such as public announcements or completely private announcements to groups, gives what we call an action signature, and then each family of action signatures gives a logical language. The construction of these languages is the main topic of this paper. We also mention the systems that capture the valid sentences of our logics. But we defer to a separate paper the completeness proof. (shrink)