Skip to Main content Skip to Navigation
Conference papers

Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely

Dominik Scheder 1, *
Abstract : We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k^2 4^k clauses, and on the other hand, any linear k-CNF formula with at most 4^k/(8e^2k^2) clauses is satisfiable. The upper bound uses probabilistic means, and we have no explicit construction coming even close to it. One reason for this is that unsatisfiable linear formulas exhibit a more complex structure than general (non-linear) formulas: First, any treelike resolution refutation of any unsatisfiable linear k-CNF formula has size at least 2^(2^(k/2-1))$. This implies that small unsatisfiable linear k-CNF formulas are hard instances for Davis-Putnam style splitting algorithms. Second, if we require that the formula F have a strict resolution tree, i.e. every clause of F is used only once in the resolution tree, then we need at least a^a^...^a clauses, where a is approximately 2 and the height of this tower is roughly k.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 11:50:29 AM
Last modification on : Tuesday, March 5, 2019 - 9:30:11 AM
Long-term archiving on: : Friday, June 18, 2010 - 8:13:58 PM


Files produced by the author(s)


  • HAL Id : inria-00455809, version 1



Dominik Scheder. Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.621-632. ⟨inria-00455809⟩



Record views


Files downloads