Journal of the ACM (JACM)
The complexity of model checking for circumscriptive formulae
Information Processing Letters
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
What makes propositional abduction tractable
Artificial Intelligence
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. On the one hand, they reveal some reasons responsible for the hardness of computing answer sets. On the other hand, they identify classes of problem instances, for which the problem is "easy" (in P) or "easier than in general" (in NP).