On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional belief base update and minimal change
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
Relevance sensitive belief structures
Annals of Mathematics and Artificial Intelligence
Applications of Belief Revision
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
A New Model for Belief Representation and Belief Revision Based on Inconsistencies Locality
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
In [1], the authors have extended Parikh's relevance-sensitive model for belief revision by defining a new model for belief representation and local belief revision called C -structure Model. This model allows to make local revision when Parikh's model fails to do it: the case of "fully overlapping belief sets". Using Grove's system of spheres construction, we consider additional constraints to define an ordering between interpretations, and show that these constraints allow to formalize perfectly the local revision by the mean of C -structure model, thus providing a well defined semantics for revision of C -structures.