Lp, a logic for representing and reasoning with statistical knowledge
Computational Intelligence
Propositional knowledge base revision and minimal change
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
On the logic of iterated belief revision
Artificial Intelligence
Nonmonotonic reasoning, conditional objects and possibility theory
Artificial Intelligence
A sequential reversible belief revision method based on polynomials
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Focusing vs. Belief Revision: A Fundamental Distinction When Dealing with Generic Knowledge
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Revision sequences and nested conditionals
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Iterated theory base change: a computational model
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Generalized update: belief change in dynamic settings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the input observation 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 lexicographic ordering. This encoding makes it very easy to implement and iterate the revision rule using simple operations on these polynomials. Moreover, polynomials allow to keep track of the sequence of observations. Lastly, it is shown how to efficiently 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 drastic one can think of, in accordance with Darwiche and Pearl's principles, and thus contrasts with the minimal change rule called natural belief revision. The paper also shows how to obtain the reversibility of Boutilier's natural belief revision and possibilistic revision using polynomials.