The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete
We prove that the inference problem of propositional circumscription for afine 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 afine formula.
KeywordsMinimal Model Minimal Solution Conjunctive Normal Form Truth Assignment Inference Problem
Unable to display preview. Download preview PDF.
- [Cad92]M. Cadoli. The complexity of model checking for circumscriptive formulae. Inf. Proc. Letters, 44(3):113–118, 1992.Google Scholar
- [EG93]T. Eiter and G. Gottlob. Propositional circumscription and extended closed-world reasoning are IIp 2-complete. TCS, 114(2):231–245, 1993.Google Scholar
- [KK01a]L. M. Kirousis and P. G. Kolaitis. The complexity of minimal satisfiability problems. In A. Ferreira and H. Reichel, (eds), Proc. 18th STACS, Dresden (Germany), LNCS 2010, pp 407–418. Springer, 2001.Google Scholar
- [KK01b]L. M. Kirousis and P. G. Kolaitis. A dichotomy in the complexity of propositional circumscription. In Proc. 16th LICS, Boston (MA), pp 71–80. 2001.Google Scholar
- [KSS00]D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos. Generating all maximal models of a boolean expression. Inf. Proc. Letters, 74(3–4):157–162, 2000.Google Scholar