Abstract
We study the Boolean Satisfiability Problem (SAT) restricted on input formulas for which there are linear arithmetic constraints imposed on the indices of variables occurring in the same clause. This can be seen as a structural counterpart of Schaefer’s dichotomy theorem which studies the SAT problem with additional constraints on the assigned values of variables in the same clause. More precisely, let k-SAT(\(m,\mathcal{A}\)) denote the SAT problem restricted on instances of k-CNF formulas, in every clause of which the indices of the last k − m variables are totally decided by the first m ones through some linear equations chosen from \(\mathcal{A}\). For example, if \(\mathcal{A}\) contains i 3 = i 1 + 2i 2 and i 4 = i 2 − i 1 + 1, then a clause of the input to 4-SAT(\(2,\mathcal{A}\)) has the form \(y_{i_1}\lor y_{i_2} \lor y_{i_1+2i_2} \lor y_{i_2-i_1+1}\), with y i being x i or \(\overline{x_i}\). We obtain the following results:
-
1
If m ≥ 2, then for any set \(\mathcal{A}\) of linear constraints, the restricted problem k-SAT\((m,\mathcal{A})\) is either in P or NP-complete assuming P ≠ NP. Moreover, the corresponding #SAT problem is always #P-complete, and the Max-SAT problem does not allow a polynomial time approximation scheme assuming P ≠ NP.
-
2
m = 1, that is, in every clause only one index can be chosen freely. In this case, we develop a general framework together with some techniques for designing polynomial-time algorithms for the restricted SAT problems. Using these, we prove that for any \(\mathcal{A}\), #2-SAT \((1,\mathcal{A})\) and Max-2-SAT\((1,\mathcal{A})\) are both polynomial-time solvable, which is in sharp contrast with the hardness results of general #2-SAT and Max-2-SAT. For fixed k ≥ 3, we obtain a large class of non-trivial constraints \(\mathcal{A}\), under which the problems k -SAT \((1,\mathcal{A})\), #k -SAT \((1,\mathcal{A})\) and Max-k-SAT\((1,\mathcal{A})\) can all be solved in polynomial time or quasi-polynomial time.
This work was supported in part by the National Natural Science Foundation of China Grant 60553001, 61073174, 61033001 and the National Basic Research Program of China Grant 2007CB807900, 2007CB807901.
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
Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: refining Schaefer’s theorem. J. Comput. System Sci. 75(4), 245–254 (2009)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
Borosh, I., Flahive, M., Rubin, D., Treybig, B.: A Sharp Bound for Solutions of Linear Diophantine Equations. Proceedings of the American Mathematical Society 105(4), 844–846 (1989)
Borosh, I., Flahive, M., Treybig, B.: Small solution of linear Diophantine equations. Discrete Mathematics 58(3), 215–220 (1986)
Bradley, G.H.: Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations. Mathematics of Computation 25(116), 897–907 (1971)
Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the 3rd ACM STOC, pp. 151–158 (1971)
Gebauer, H., Szabó, T., Tardos, G.: The local lemma is tight for SAT. CoRR (Computing Research Repository), arXiv:1006.0744 (2010)
Georgiou, K., Papakonstantinou, P.A.: Complexity and algorithms for well-structured k-SAT instances. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 105–118. Springer, Heidelberg (2008)
Håstad, J.: Some optimal inapproximability results. J. ACM 48(4), 798–859 (2001)
Henschen, L., Wos, L.: Unit refutations and Horn sets. J. ACM 21(4), 590–605 (1974)
Kratochvíl, J., Savický, P., Tuza, Z.: One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput. 22(1), 203–210 (1993)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)
Monien, B., Sudborough, I.H.: Bandwidth constrained NP-complete problems. In: Proceedings of the 13th ACM STOC, pp. 207–217 (1981)
Rosen, K.H.: Elementary number theory and its applications, 5th edn. Addison-Wesley, Reading (2005)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM STOC, pp. 216–226 (1978)
Tovey, C.A.: A simplified satisfiability problem. Discrete Appl. Math. 8(1), 85–89 (1984)
Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189–201 (1979)
Valiant, L.G.: The complexity of enumeration and reliability Problems. SIAM J. Comput. 8(3), 410–421 (1979)
Yamasaki, S., Doshita, S.: The satisfiability problem for the class consisting of Horn sentences and some non-Horn sentences in propositional logic. Infor. Control 59(1-3), 1–12 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, H., He, J. (2010). Satisfiability with Index Dependency. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)