Abstract
The inference problem for propositional circumscription is known to be highly intractable and, in fact, harder than the inference problem for classical propositional logic. More precisely, in its full generality this problem is Π2P-complete, which means that it has the same inherent computational complexity as the satisfiability problem for quantified Boolean formulas with two alternations (universal-existential) of quantifiers. We use Schaefer’s framework of generalized satisfiability problems to study the family of all restricted cases of the inference problem for propositional circumscription. Our main result yields a complete classification of the “truly hard” (Π2P-complete) and the “easier” cases of this problem (reducible to the inference problem for classical propositional logic). Specifically, we establish a dichotomy theorem which asserts that each such restricted case either is Π2P-complete or is in coNP. Moreover, we provide efficiently checkable criteria that tell apart the “truly hard” cases from the “easier” ones. We show our results both when the formulas involved are and are not allowed to contain constants. The present work complements a recent paper by the same authors, where a complete classification into hard and easy cases of the model-checking problem in circumscription was established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Kirousis, L., Kolaitis, P. A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput Systems 37, 695–715 (2004). https://doi.org/10.1007/s00224-004-1152-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1152-8