Abstract
In the present paper we introduce the class of linear CNF formulas generalizing the notion of linear hypergraphs. Clauses of a linear formula intersect in at most one variable. We show that SAT for the general class of linear formulas remains NP-complete. Moreover we show that the subclass of exactly linear formulas is always satisfiable. We further consider the class of uniform linear formulas and investigate conditions for the formula graph to be complete. We define a formula hierarchy such that one can construct a 3-uniform linear formula belonging to the ith level such that the clause-variable density is of Ω(2.5i − − 1) ∩O(3.2i − − 1). Finally, we introduce the subclasses LCNF ≥ k of linear formulas having only clauses of length at least k, and show that SAT remains NP-complete for LCNF ≥ 3.
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.
Similar content being viewed by others
References
Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
Böhm, M., Speckenmeyer, E.: A Fast Parallel SAT-Solver – Efficient Workload Balancing. Annals of Mathematics and Artificial Intelligence 17, 381–400 (1996)
Bollobas, B.: Combinatorics, Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability. Cambridge University Press, Cambridge (1986)
Erdös, P.: Problems and results in Graph Theory. Congressus Numerantium 15, 169–192 (1976)
Even, S., Kariv, O.: An O(n 2.5) Algorithm for Maximum Matching in General Graphs. In: Proc. of 16-th Annual Symposium on Foundations of Computer Science, pp. 100–112. IEEE, Los Alamitos (1975)
Franco, J., Gelder, A.v.: A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Appl. Math. 125, 177–214 (2003)
Hall, P.: On representatives of subsets. J. London Math. Soc. 10, 26–30 (1935)
König, D.: Graphen und Matrizen. Math. Fiz. Lapok 38, 116–119 (1931)
Lindner, C.C., Rosa, A. (eds.): Topics on Steiner Systems, Annals of Discrete Math., vol. 7. North-Holland, Amsterdam (1980)
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyanski, L.: Determining Computational Complexity from Characteristic ‘Phase Transitions’. Nature 400, 133–137 (1999)
Palisse, R.: A short proof of Fisher’s inequality. Discrete Math. 111, 421–422 (1993)
Porschen, S., Speckenmeyer, E., Randerath, B.: On linear CNF formulas, Techn. Report zaik2006-520, Univ. Köln (2006)
Ryser, H.J.: An extension of a theorem of de Bruijn and Erdös on combinatorial designs. J. Algebra 10, 246–261 (1968)
Ryser, H.J.: Combinatorial Mathematics, Carus Mathematical Monographs, Mathematical Association of America, vol. 14 (1963)
Tovey, C.A.: A Simplified NP-Complete Satisfiability Problem. Discrete Appl. Math. 8, 85–89 (1984)
Wilson, R.M.: An existence theory for pairwise balanced designs, II. J. Combin. Theory A 13, 246–273 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porschen, S., Speckenmeyer, E., Randerath, B. (2006). On Linear CNF Formulas. In: Biere, A., Gomes, C.P. (eds) Theory and Applications of Satisfiability Testing - SAT 2006. SAT 2006. Lecture Notes in Computer Science, vol 4121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814948_22
Download citation
DOI: https://doi.org/10.1007/11814948_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37206-6
Online ISBN: 978-3-540-37207-3
eBook Packages: Computer ScienceComputer Science (R0)