Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Artificial Intelligence
Updating logical databases
The complexity of model checking for circumscriptive formulae
Information Processing Letters
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of nested counterfactuals and iterated knowledge base revisions
Journal of Computer and System Sciences
On compact representations of propositional circumscription
Theoretical Computer Science
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A survey on knowledge compilation
AI Communications
Sometimes updates are circumscription
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
Relating belief revision and circumscription
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper, following the approach of Gocic, Kautz, Papadimitriou and Selman (1995), we consider the ability of belief revision operators to succinctly represent a certain set of models. In particular, we show that some of these operators are more efficient than others, even though they have the sane model checking complexity. We show that these operators are partially ordered, i.e. some of them are not comparable. We also strengthen some of the results by Cadoli, Donini, Liberatore and Shaerf (1995) by showing that for some of the so called "model based" operators, a polynomial size representation does not exist even if we allow the new knowledge base to have a non polynomial time model checking (namely, either in NP or in co-NP). Finally, we show that Dalal's and Weber's operators can be compiled one into the other via a formalism whose model checking is in NP. All of our results also hold when iterated revision, for one or more of the operators, is considered.