Negation as failure: Careful closure procedure
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
An algorithm to compute circumscription
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
Weak generalized closed world assumption
Journal of Automated Reasoning
Some results concerning the computational complexity of abduction
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Hard problems for simple default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The tractability of path-based inheritance
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
How to Complete an Interactive Configuration Process?
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the computational complexity of the different forms of closed world reasoning for various fragments of propositional logic. The analysis allows us to draw a complete picture of the tractability/ intractability frontier for such a form of nonmonotonic reasoning. We also discuss how to use our results in order to characterize the computational complexity of other problems related to nonmonotonic inheritance, diagnosis, and default reasoning.