Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
Updating logical databases
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Sometimes updates are circumscription
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A unified view of propositional knowledge base updates
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Succinct Representations of Model Based Belief Revision
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Spatial Information Revision: A Comparison between 3 Approaches
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
A New Framework for Local Belief Revision
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Revision of Spatial Information by Containment
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Distance-Based Semantics for C-Structure Belief Revision
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
One of the main challenges in the formal modeling of common-sense reasoning is the ability to cope with the dynamic nature of the world. Among the approaches put forward to address this problem are belief revision and update. Given a knowledge base T, representing our knowledge of the "state of affairs" of the world of interest, it is possible that we are lead to trust another piece of information P, possibly inconsistent with the old one T. The aim of revision and update operators is to characterize the revised knowledge base T′ that incorporates the new formula P into the old one T while preserving consistency and, at the same time, avoiding the loss of too much information in this process. In this paper we study the computational complexity of one of the main computational problems of belief revision and update: deciding if an interpretation M is a model of the revised knowledge base.