The Lovász Local Lemma and Satisfiability
We consider boolean formulas in conjunctive normal form (CNF). If all clauses are large, it needs many clauses to obtain an unsatisfiable formula; moreover, these clauses have to interleave. We review quantitative results for the amount of interleaving required, many of which rely on the Lovász Local Lemma, a probabilistic lemma with many applications in combinatorics.
In positive terms, we are interested in simple combinatorial conditions which guarantee for a CNF formula to be satisfiable. The criteria obtained are nontrivial in the sense that even though they are easy to check, it is by far not obvious how to compute a satisfying assignment efficiently in case the conditions are fulfilled; until recently, it was not known how to do so. It is also remarkable that while deciding satisfiability is trivial for formulas that satisfy the conditions, a slightest relaxation of the conditions leads us into the territory of NP-completeness.
Several open problems remain, some of which we mention in the concluding section.
Unable to display preview. Download preview PDF.
- 2.Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sós, V.T. (eds.) Infinite and Finite Sets (to Paul Erdős on his 60th birthday), vol. II, pp. 609–627. North-Holland, Amsterdam (1975)Google Scholar
- 8.Czumaj, A., Scheideler, C.: A new algorithm approach to the general Lovász Local Lemma with applications to scheduling and satisfiability problems. In: Proc. 32nd Ann. ACM Symp. on Theory of Computing, pp. 38–47 (2000)Google Scholar
- 9.Srinivasan, A.: Improved algorithmic versions of the Lovász Local Lemma. In: Proc. 19th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 611–620 (2008)Google Scholar
- 10.Moser, R.A.: Derandomizing the Lovász Local Lemma more effectively. CoRR abs/0807.2120 (2008)Google Scholar
- 11.Moser, R.A.: A constructive proof of the Lovász Local Lemma. CoRR abs/0810.4812 (2008); Proc. 41st Ann. ACM Symp. on Theory of Computing (to appear)Google Scholar
- 12.Moser, R.A., Tardos, G.: A constructive proof of the general Lovász Local Lemma. CoRR abs/0903.0544 (2009)Google Scholar
- 15.Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity (ECCC) 10(022) (2003)Google Scholar
- 20.Gebauer, H.: Disproof of the neighborhood conjecture with implications to SAT. CoRR abs/0904.2541 (2009)Google Scholar
- 22.Stříbrná, J.: Between Combinatorics and Formal Logic, Master’s Thesis. Charles University, Prague (1994)Google Scholar
- 33.Scheder, D.: Unsatisfiable linear CNF formulas are large, and difficult to construct explicitely. CoRR abs/0905.1587 (2009)Google Scholar
- 35.Scheder, D.: Unsatisfiable linear k-CNFs exist, for every k. CoRR abs/0708.2336 (2007)Google Scholar