Belief revision in the propositional closure of a qualitative algebra

Belief revision is an operation that aims at modifying old be-liefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms, in particular, in qualitative algebras (QAs) in which the result is a disjunction of belief bases that is not necessarily repre-sentable in a QA. This motivates the study of belief revision in formalisms extending QAs, namely, their propositional clo-sures: in such a closure, the result of belief revision belongs to the formalism. Moreover, this makes it possible to define a contraction operator thanks to the Harper identity. Belief revision in the propositional closure of QAs is studied, an al-gorithm for a family of revision operators is designed, and an open-source implementation is made freely available on the web

Belief change in branching time: AGM-consistency and iterated revision

We study belief change branching-time structures. First, we identify a property of branching-time frames that is equivalent to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision function that satisfies the AGM postulates. Second, we provide a set of modal axioms that characterize the class of AGM-consistent frames within the modal logic introduced in [Bonanno, Axiomatic characterization of the AGM theory of belief revision in a temporal logic, Artificial Intelligence, 2007]. Third, we introduce a generalization of AGM belief revision functions that allows a clear statement of principles of iterated belief revision and discuss iterated revision both semantically and syntactically.iterated belief revision, branching time, information, belief, modal logic, AGM belief revision

Multiplayer belief revision

One main topic of the epistemic program of game theory deals with the value of information. To study this question in a broad context, one needs to adapt some of the tools used in multiplayer epistemic logic. A hierarchical belief structure is introduced both in a syntactical and semantical framework. In the same framework, a generalized notion of message is characterized by its content and its status. For a given message, a multiplayer belief revision rule that transforms any initial belief structure into a final belief one is designed. A representation theorem relates syntactical axioms to the belief revision rule.Belief revision, message, epistemic logic.

A characterization of sequential equilibrium in terms of AGM belief revision

In [G. Bonanno, Rational choice and AGM belief revision, Artificial Intelligence, 2009] a semantics for one-stage AGM belief revision was proposed based on choice frames, borrowed from the rational choice literature. In this paper we extend the semantics of choice frames to deal with iterated belief revision and use the corresponding structures to analyze extensive-form games. Choice frames can be used to represent a player's initial beliefs and disposition to change those beliefs when informed that it is her turn to move. If the frame satisfies AGM-consistency and a natural postulate for iterated belief revision, then it is rationalizable by a total pre-order on the set of histories. We show that three properties of this total pre-order, together with the hypothesis of agreement among players, provide a characterization of the notion of consistent assessment, which is the central component of the notion of sequential equilibrium proposed by Kreps and Wilson [Econometrica, 1982].Choice function, AGM belief revision, extensive-form game, sequential equilibrium, iterated belief revision, backward induction.