Making believers out of computers
Artificial Intelligence
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Cumulative default logic: in defense of nonmonotonic inference rules
Artificial Intelligence
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Cumulative default logic: finite characterization, algorithms, and complexity
Artificial Intelligence
Alternative approaches to default logic
Artificial Intelligence
ACM Computing Surveys (CSUR)
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Constrained and rational default logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
On the complexity of extension checking in default logic
Information Processing Letters
On the complexity of extension checking in default logic
Information Processing Letters
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We analyze the complexity of deciding whether a propositional interpretation is a model of a default theory for some of the variants of default logic presented in the literature: Reiter's, justified, constrained, rational, and cumulative. We prove that all the analyzed variants are Σp2-complete in the general case, and remains so even if all defaults are prerequisite-free and seminormal. Cumulative default logic is also Σp2-complete even if all defaults are normal and prerequisite-free. The other semantics are Δp2[log n]-complete and coNP-complete if all defaults are normal and prerequisites are allowed or not, respectively.