Abstract
A dichotomy theorem for a class of decision problems is a result asserting that certain problems in the class are solvable in polynomial time, while the rest are NP-complete. The first remarkable such dichotomy theorem was proved by T.J. Schaefer in 1978. It concerns the class of generalized satisfiability problems SAT(S), whose input is a CNF(S)-formula, i.e., a formula constructed from elements of a fixed set S of generalized connectives using conjunctions and substitutions by variables. Here, we investigate the complexity of minimal satisfiability problems MIN SAT(S), where S is a fixed set of generalized connectives. The input to such a problem is a CNF(S)-formula and a satisfying truth assignment; the question is to decide whether there is another satisfying truth assignment that is strictly smaller than the given truth assignment with respect to the coordinate-wise partial order on truth assignments. Minimal satisfiability problems were first studied by researchers in artificial intelligence while investigating the computational complexity of propositional circumscription. The question of whether dichotomy theorems can be proved for these problems was raised at that time, but was left open. In this paper, we settle this question affirmatively by establishing a dichotomy theorem for the class of all MIN SAT(S)-problems.
Research conducted while on sabbatical at the University of California, Santa Cruz and partially supported by the University of Patras, by NSF grant CCR-9610257 and by the Computer Technology Institute. Partially supported by NSF grants CCR-9610257 and CCR-9732041.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, pages 113–118, 1992.
M. Cadoli. Two Methods for Tractable Reasoning in Artificial Intelligence: Language Restriction and Theory Approximation. PhD thesis, Univ. Di Roma, 1993.
N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125(1):1–12, 1996.
N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51:511–522, 1995.
R. Dechter and J. Pearl. Structure identification in relational data. Artificial Intelligence, 48:237–270, 1992.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed homeomorphism problem. Theoretical Computer Science, 10:111–121, 1980.
T.A. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. on Computing, 28:57–104, 1999.
M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.
P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92–110, 1990.
G. Istrate. Looking for a version of Schaefer’s dichotomy theorem when each variable occurs at most twice. T.R. 652, Computer Science Department, The University of Rochester, 1997.
P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the Association for Computing Machinery, 44:527–548, 1997.
D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM Journal of Computing, 28(1):152–163, 1998.
S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: the approximability of minimization problems. Proc. 12th IEEE Conf. on Computational Complexity, 282–296, 1997.
S. Khanna, M. Sudan, and D.P. Williamson. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 11–20, 1997.
L.M. Kirousis and Ph.G. Kolaitis. The complexity of minimal satisfiability problems. Electronic Coll. Computational Complexity (http://www.eccc.uni-trier.de/eccc), No. 82, 2000.
Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proc. 17th ACM Symp. on Principles of Database Systems, pages 205–213, 1998.
R. Ladner. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery, 22:155–171, 1975.
V. Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence-AAAI’ 85, pages 121–127, 1985.
J. McCarthy. Circumscription-a form of nonmonotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
J. McCarthy. Applications of circumscription in formalizing common sense knowledge. Artificial Intelligence, 28:89–116, 1985.
S. Reith and H. Vollmer. Optimal satisfiability for propositional calculi and constraint satisfaction problems. In Proc. 25th Symposium on Mathematical Foundations of Computer Science-MFCS 2000, pages 640–649, Lecture Notes in Computer Science, Springer, 2000.
T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACMSymp. on Theory of Computing, pages 216–226, 1978.
U. Zwick. Finding almost-satisfying assignments. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 551–560, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirousis, L.M., Kolaitis, P.G. (2001). The Complexity of Minimal Satisfiability Problems. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-44693-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41695-1
Online ISBN: 978-3-540-44693-4
eBook Packages: Springer Book Archive