On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Symbolic Logic
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Relevance sensitive belief structures
Annals of Mathematics and Artificial Intelligence
An Inconsistency Tolerant Model for Belief Representation and Belief Revision
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Applications of Belief Revision
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
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 |
AGM-style revision consists of two suboperations, contraction followed by expansion. With respect to Hansson, this is called "internal revision" and an alternative procedure, "external revision" is proposed. It consists in, first, expanding the belief base by the new sentence and after that contracting by its negation. In this paper, on the one hand, we propose a new framework for local belief revision by extending the LS-model introduced by Parikh and studied by several authors in the last decade. The new model, called the C-structure model, is based on adapting the containment property in propositional logic, since it has been defined in a spatial context. On the other hand, we define a "local external revision" operation equivalent to the one defined by Hansson -in a classical (not-local) framework- by defining local contraction operation.