Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Negation as failure: Careful closure procedure
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
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
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Default reasoning using classical logic
Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
A survey on knowledge compilation
AI Communications
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper presents new complexity results for propositional closed world reasoning (CWR) from tractable knowledge bases (KBs). Both (basic) CWR, generalized CWR, extended generalized CWR, careful CWR and extended CWR (equivalent to circumscription) are considered. The focus is laid on tractable KBs belonging to target classes for exact compilation functions: Blake formulas, DNFs, disjunctions of Horn formulas, and disjunctions of renamable Horn formulas. The complexity of inference is identified for all the forms of CWR listed above. For each of them, new tractable fragments are exhibited. Our results suggest knowledge compilation as a valuable approach to deal with the complexity of CWR in some situations.