Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Formalizing nonmonotonic reasoning systems
Artificial Intelligence
The mathematics of inheritance systems
The mathematics of inheritance systems
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
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
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
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth 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
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
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
Privacy preservation using multi-context systems and default logic
Correct Reasoning
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
| Hi-index | 0.00 |
We investigate the computational complexity of membership problems in a number of propositional default logics. We introduce a hierarchy of classes of propositional default rules that extends that described in [Kautz and Selman 1989], and characterize the complexity of membership problems in these classes under various simplifying assumptions about the underlying propositional theory. Our work significantly extends both that presented in [Kautz and Selman 1989] and in [Stillman 1990a].