Closed-world databases and circumscription
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Journal of Computer and System Sciences
Negation as failure: Careful closure procedure
Artificial Intelligence
On the integrity of databases with incomplete information
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
A circumscriptive theorem prover
Artificial Intelligence
Weak generalized closed world assumption
Journal of Automated Reasoning
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
Some computational aspects of circumscription
Journal of the ACM (JACM)
On theorem provers for circumscription
Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Journal of Computer and System Sciences
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The tractability of path-based inheritance
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Negation and minimality in non-horn databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A logical reconstruction of SPKI
Journal of Computer Security - Special issue on CSFW14
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
A theoretical framework on proactive information exchange in agent teamwork
Artificial Intelligence
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Complexity of counting the optimal solutions
Theoretical Computer Science
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
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
A theoretical framework on proactive information exchange in agent teamwork
Artificial Intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
The Complexity of Handling Minimal Solutions in Logic-Based Abduction
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
Hi-index | 0.00 |
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. Several forms of closed world reasoning have been proposed in the literature, ranging from the closed world assumption, introduced in the context of data bases, to the extended closed world assumption, which is equivalent to circumscription. The aim of this paper is to present a detailed analysis of the computational complexity of the different forms of closed world reasoning for various fragments of propositional logic. Such an analysis allows us to draw a complete picture of the boundary between tractability and intractability of such a form of nonmonotonic reasoning. We also discuss how to use our results in order to characterize the computational complexity of other nonmonotonic reasoning problems, namely nonmonotonic inheritance, diagnosis, and default reasoning.