Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. on Inf. Theory, IT-24(3):384–386, 1978.
M. Cadoli. The complexity of model checking for circumscriptive formulae. Inf. Proc. Letters, 44(3):113–118, 1992.
M. Cadoli and M. Lenzerini. The complexity of propositional closed world reasoning and circumscription. JCSS, 48(2):255–310, 1994.
S. Coste-Marquis and P. Marquis. Knowledge compilation for closed world reasoning and circumscription. J. Logic and Comp., 11(4):579–607, 2001.
T. Eiter and G. Gottlob. Propositional circumscription and extended closed-world reasoning are IIp 2-complete. TCS, 114(2):231–245, 1993.
M. Gelfond, H. Przymusinska, and T. C. Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38(1):75–94, 1989.
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.
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.
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.
J. McCarthy. Circumscription-A form of non-monotonic reasoning. Artificial Intelligence, 13(1–2):27–39, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand, A., Hermann, M. (2003). The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive