A sequential reversible belief revision methods based on polynomials - Université d'Artois Access content directly
Conference Papers Year : 1999

A sequential reversible belief revision methods based on polynomials


This paper deals with iterated belief change and proposes a revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the input observartion holds is more plausible that any world where it does not. This change rule makes sense in a dynamic context where observations are received, and the newer observations are considered more plausible than older ones. It is shown how to encode an epistemic state using polynomials equipped with the lexicographical ordering. This encoding makes it very easy to implement and iterate the revision rule using simple operations on these polynomials. Moreover, polynonomials allow to keep track of the sequence of observations. Lastly, it is shown how to practically compute the revision rule at the syntactical level, when the epistemic state is concisely represented by a prioritized belief base. Our revision rule is the most refined one can think of, in accordance with darwiche and Pearl’s principles, and thus contrast with the minimal change rule called natural belief revision.
Not file

Dates and versions

hal-03299823 , version 1 (26-07-2021)


  • HAL Id : hal-03299823 , version 1


Salem Benferhat, Didier Dubois, Odile Papini. A sequential reversible belief revision methods based on polynomials. 16th National conference in Artificial Intelligence (AAAI 1999), AAAI: Association for the Advancement of Artificial Intelligence, Jul 1999, Orlando, Florida, United States. pp.733-738. ⟨hal-03299823⟩
39 View
0 Download


Gmail Facebook Twitter LinkedIn More