Abstract
Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The inference problem for propositional circumscription has been extensively studied from the viewpoint of computational complexity. We prove that there exists a trichotomy for the complexity of the inference problem in propositional variable circumscription. More specifically we prove that every restricted case of the problem is either \(\Pi_{\rm 2}^{\rm P}\)-complete, coNP-complete, or in P.
Supported by the National Graduate School in Computer Science (CUGS), Sweden.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with boolean blocks, part I: Post’s lattice with applications to complexity theory. ACM SIGACT-Newsletter 34(4), 38–52 (2003)
Cadoli, M., Lenzerini, M.: The complexity of closed world reasoning and circumscription. Journal of Computer and System Sciences, 255–301 (1994)
Cook, S.: The complexity of theorem proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Coste-Marquis, S., Marquis, P.: Complexity results for propositional closed world reasoning and circumscription from tractable knoledge bases. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 24–29 (1999)
Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of boolean constraint satisfaction problems. SIAM, Philadelphia (2001)
Dalmau, V.: Computational Complexity of Problems over Generalized Formulas. PhD thesis, Department LSI, Universitat Politècnica de Catalanya, Barcelona (2000)
Durand, A., Hermann, M.: The inference problem for propositional circumscription of affine formulas is coNP-complete. In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, pp. 451–462 (2003)
Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are ΠP 2 -complete. Theoretical Computer Science 114, 231–245 (1993)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)
Kirousis, L., Kolaitis, P.: A dichotomy in the complexity of propositional circumscription. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, pp. 71–80 (2001)
Kirousis, L., Kolaitis, P.: The complexity of minimal satisfiability problems. Information and Computation 187(1), 20–39 (2003)
Ladner, R.: On the structure of polynomial time reducibility. Journal of the ACM 22, 155–171 (1975)
McCarthy, J.: Circumscription - a form of nonmonotonic reasoning. Artificial Intelligence 13, 27–39 (1980)
Nordh, G., Jonsson, P.: An algebraic approach to the complexity of propositional circumscription. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 367–376 (2004)
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)
Pöschel, R., Kaluznin, L.: Funktionen-und Relationenalgebren. DVW, Berlin (1979)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing, pp. 216–226 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nordh, G. (2005). A Trichotomy in the Complexity of Propositional Circumscription. In: Baader, F., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32275-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-32275-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25236-8
Online ISBN: 978-3-540-32275-7
eBook Packages: Computer ScienceComputer Science (R0)