Propositional knowledge base revision and minimal change
Artificial Intelligence
Studies in belief change
On the logic of iterated belief revision
Artificial Intelligence
Journal of Logic, Language and Information
Dynamic belief revision operators
Artificial Intelligence
A negotiation-style framework for non-prioritised revision
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Changing conditional beliefs unconditionally
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Distance semantics for belief revision
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Iterated belief revision, revised
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
On the logic of iterated non-prioritised revision
WCII'02 Proceedings of the 2002 international conference on Conditionals, Information, and Inference
On the Dynamics of Total Preorders: Revising Abstract Interval Orders
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Learning by Questions and Answers: From Belief-Revision Cycles to Doxastic Fixed Points
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On the measure of conflicts: Shapley Inconsistency Values
Artificial Intelligence
Extending Removed Sets Revision to partially preordered belief bases
International Journal of Approximate Reasoning
Iterated belief change due to actions and observations
Journal of Artificial Intelligence Research
A framework for managing uncertain inputs: An axiomization of rewarding
International Journal of Approximate Reasoning
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Parallel belief revision: Revising by sets of formulas
Artificial Intelligence
Revising beliefs on the basis of evidence
International Journal of Approximate Reasoning
Hi-index | 0.00 |
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier's natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that the penultimate input is not ignored completely, thereby eliminating natural revision, but includes the Darwiche-Pearl operator, Nayak's lexicographic revision operator, and a newly introduced operator called restrained revision. We demonstrate that restrained revision is the most conservative of admissible revision operators, effecting as few changes as possible, while lexicographic revision is the least conservative, and point out that restrained revision can also be viewed as a composite operator, consisting of natural revision preceded by an application of a "backwards revision" operator previously studied by Papini. Finally, we propose the establishment of a principled approach for choosing an appropriate revision operator in different contexts and discuss future work.