Propositional knowledge base revision and minimal change
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
Journal of Logic, Language and Information
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A General Model for Epistemic State Revision using Plausibility Measures
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Encoding the Revision of Partially Preordered Information in Answer Set Programming
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A general family of preferential belief removal operators
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Extending Removed Sets Revision to partially preordered belief bases
International Journal of Approximate Reasoning
Underwater archaeological 3D surveys validation within the removed sets framework
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Estimation and conflict detection in human controlled systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Revision over partial pre-orders: a postulational study
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Confluence operators and their relationships with revision, update and merging
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
This paper deals with iterated revision of partially ordered information. The first part of this paper concerns the Katsuno-Mendelzon's postulates: we first point out that these postulates are not fully satisfactory since only a class of partially ordered information can be revised. We then propose a suitable definition of faithful assignment, followed by a new set of postulates and a representation theorem. The second part of this paper investigates additional postulates dedicated to iterated revision operators of partially ordered information. Three extensions of well-known iterated belief revision operations for dealing with partially ordered information are briefly presented.