Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
Updating logical databases
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 complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Succinct Representations of Model Based Belief Revision
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Knowledge integration for description logics
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Nonmonotonic formalisms and belief revision operators have been introduced as useful tools to describe and reason about evolving scenarios Both approaches have been proven effective in a number of different situations. However, little is known about their relationship Previous work by Winslett has shown some correlations between a specific operator and circumscription In this paper we greatly extend Winslett's work by establishing new relations between circumscription and a large number of belief revision operators. This highlights similarities and differences between these formalisms Furthermore these connections provide us with the possibility of importing results in one field into the other one.