Abstract
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which allows to conclude that the facts derivable from a given knowledge base are all facts that satisfy a given property. In this paper, we study the computational complexity of several formalizations of inference in propositional circumscription for the case that the knowledge base is described by a propositional theory using only a restricted set of Boolean functions. To systematically cover all possible sets of Boolean functions, we use Post’s lattice. With its help, we determine the complexity of circumscriptive inference for all but two possible classes of Boolean functions. Each of these problems is shown to be either \({\Pi^{\rm p}_{2}}\)-complete, coNP-complete, or contained in L.
In particular, we show that in the general case, unless P = NP, only literal theories admit polynomial-time algorithms, while for some restricted variants the tractability border is the same as for classical propositional inference.
Supported by DFG grant VO 630/6-1.
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
Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 48–62. Springer, Heidelberg (2007)
Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. ACM CoRR, arXiv:0811.0959v1 [cs.CC] (2008)
Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 51–64. Springer, Heidelberg (2009)
Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT News 34(4), 38–52 (2003)
Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace MOD-classes. Mathematical Systems Theory 25, 223–237 (1992)
Cadoli, M., Donini, F., Schaerf, M.: On compact representations of propositional circumscription. Theor. Comput. Sci. 182, 205–216 (1995)
Cadoli, M., Lenzerini, M.: The complexity of closed world reasoning and circumscription. In: Proc. 8th AAAI, pp. 550–555 (1990)
Cadoli, M., Lenzerini, M.: The complexity of propositional closed world reasoning and circumscription. J. Comput. Syst. Sci. 48(2), 255–310 (1994)
Durand, A., Hermann, M.: The inference problem for propositional circumscription of affine formulas is coNP-complete. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 451–462. Springer, Heidelberg (2003)
Durand, A., Hermann, M., Nordh, G.: Trichotomies in the complexity of minimal inference (2008), http://www.ida.liu.se/~gusno/
Eiter, T., Gottlob, G.: Propositional circumscription and extended closed world reasoning are \(\Pi_2^p\)-complete. Theor. Comput. Sci. 114(2), 231–245 (1993); Addendum in TCS 118, p. 15 (1993)
Gelfond, M., Przymusinska, H., Przymusinski, T.C.: On the relationship between circumscription and negation as failure. Artificial Intelligence 38(1), 75–94 (1989)
Kirousis, L.M., Kolaitis, P.: The complexity of minimal satisfiability in Post’s lattice. Unpublished notes (2001)
Kirousis, L.M., Kolaitis, P.G.: The complexity of minimal satisfiability problems. Inf. Comput. 187(1), 20–39 (2003)
Kirousis, L.M., Kolaitis, P.G.: A dichotomy in the complexity of propositional circumscription. Theory Comput. Syst. 37(6), 695–715 (2004)
Lewis, H.: Satisfiability problems for propositional calculi. Mathematical Systems Theory 13, 45–53 (1979)
McCarthy, J.: Circumscription – A form of non-monotonic reasoning. Artificial Intelligence 13, 27–39 (1980)
Meier, A., Mundhenk, M., Thomas, M., Vollmer, H.: The complexity of satisfiability for fragments of CTL and CTL ⋆ . In: Proc. 2nd Workshop on Reachability Problems, pp. 201–213 (2008)
Nordh, G.: A trichotomy in the complexity of propositional circumscription. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 257–269. Springer, Heidelberg (2005)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Pippenger, N.: Theories of Computability. Cambridge University Press, Cambridge (1997)
Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies 5, 1–122 (1941)
Reith, S.: On the complexity of some equivalence problems for propositional calculi. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 632–641. Springer, Heidelberg (2003)
Reith, S., Wagner, K.: The complexity of problems defined by Boolean circuits. In: Proc. MFI 1999, pp. 141–156. World Science Publishing (2005)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th STOC, pp. 216–226. ACM Press, New York (1978)
Schnoor, H.: The complexity of the Boolean formula value problem. Technical report, Theoretical Computer Science, University of Hannover (2005)
Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, M. (2009). The Complexity of Circumscriptive Inference in Post’s Lattice. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)