Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Artificial Intelligence
Formalizing nonmonotonic reasoning systems
Artificial Intelligence
The mathematics of inheritance systems
The mathematics of inheritance systems
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
On the relation between default and autoepistemic logic
Artificial Intelligence
The complexity of Horn theories with normal unary defaults
Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Complexity classification of truth maintenance systems
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Hard problems for simple default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Epistemological problems of artificial intelligence
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Semantical considerations on nonmonotonic logic
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Transforming prioritized defaults and specificity into parallel defaults
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
The relationship between reasoning about privacy and default logics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Privacy preservation using multi-context systems and default logic
Correct Reasoning
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
Well-Founded Semantics for Default Logic
Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
| Hi-index | 0.00 |
We characterize the complexity of several typical problems in propositional default logics. In particular, we examine the complexity of extension membership, extension existence, and extension entailment problems. We show that the extension existence problem is Σ2p complete, even for semi-normal theories, and that the extension membership and entailment problems are Σ2p complete and Π2p complete respectively, even when restricted to normal default theories. These results contribute to our understanding of the computational relationship between propositional default logics and other formalisms for nonmonotonic reasoning, e.g., autoepistemic logic and McDermott and Doyle's NML, as well as their relationship to problems outside the realm of nonmonotonic reasoning.