On the relationship between circumscription and negation as failure
Artificial Intelligence
The complexity of model checking for circumscriptive formulae
Information Processing Letters
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
Generating all maximal models of a Boolean expression
Information Processing Letters
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
What makes propositional abduction tractable
Artificial Intelligence
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
| Hi-index | 0.00 |
We prove that the inference problem of propositional circumscription for affine formulas is coNP-complete, settling this way a longstanding open question in the complexity of nonmonotonic reasoning. We also show that the considered problem becomes polynomial-time decidable if only a single literal has to be inferred from an affine formula.