Hard and Easy Distributions of SAT Problems

We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult. Our results provide a benchmark for the evaluation of satisfiability-testing procedures.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Zvi Galil,et al.  On the Complexity of Regular Resolution and the Davis-Putnam Procedure , 1977, Theor. Comput. Sci..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[6]  John Franco.  Probabilistic Analysis of Algorithms for NP-Complete Problems. , 1984 .

[7]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[8]  Micha Hofri,et al.  Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.

[9]  David A. McAllester,et al.  A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.

[10]  John Franco,et al.  Probabilistic performance of a heuristic for the satisfiability problem , 1988, Discret. Appl. Math..

[11]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[12]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[13]  Giorgio Gallo,et al.  Algorithms for Testing the Satisfiability of Propositional Formulae , 1989, J. Log. Program..

[14]  Ming-Te Chao,et al.  Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem , 1990, Inf. Sci..

[15]  A. Vellino.  The complexity of automated reasoning , 1990 .

[16]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[17]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.