Generating hard satisfiability problems

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 17-29

  Selman, Bart ^a   Mitchell, David G ^b   Levesque, Hector J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

4.3; Benchmarks; Empirical study; Phase transitions; Random problems; Satisfiability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; TESTING;

EMPIRICAL STUDY; RANDOM PROBLEMS; SATISFIABILITY TESTING;

ARTIFICIAL INTELLIGENCE;

EID: 0030105333     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00045-3     Document Type: Article

References (39)

1. R.J. Beckman and R.D. Cook, Outlier.........s, Technometrics 25 (2) (1983) 119-149.
2. B. Bollobas, Random Graphs (Academic Press, London, 1985).
3. A. Broder, A. Frieze and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in: Proceedings Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993) 322-330.
4. M. Buro and H. Kleine-Büning, Report on a SAT competition, Technical Report #110, Department of Mathematics and Informatics, University of Paderborn, Germany (1992).
5. M. Chao and J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem, Inform. Sci. 51 (1990) 23-42.
6. V. Chvatal and B. Reed, Mick gets some (the odds are on his side), in: Proceedings FOCS-92 (1992) 620-627.
7. V. Chvatal and E. Szemeredi, Many hard examples for resolution, J. ACM 35 (4) (1988) 759-208.
8. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney, Australia (1991) 163-169.
9. S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings 3rd Annual ACM Symposium on the Theory of Computing , New York (1971) 151-158.
10. J.M. Crawford and L.D. Auton, Experimental results on the cross-over point in satisfiability problems, in: Proceedings AAAI-93, Washington, DC (1993).
11. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Commun. ACM 5 (1962) 394-397.
12. M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
13. W.F. de la Vega, On random 2SAT, Manuscript (1992).
14. J. Franco and M. Paull, Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983) 77-87.
15. A. Frieze and S. Suen, Analysis of three simple heuristics on a random instance of k-SAT, Manuscript (1992).
16. Z. Galil, On the complexity of regular resolution and the Davis-Putnam procedure, Theoret. Comput. Sci. 4 (1977) 23-46.
17. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
18. I.P. Gent and T. Walsh, Easy problems are sometimes hard, Artif. Intell. 70 (1994) 335-345.
19. A. Goerdt, A threshold for unsatisfiability, Manuscript (1991).
20. A. Goldberg, On the complexity of the satisfiability problem, Courant Computer Science Report, No. 16, New York University, New York (1979).
21. A. Haken, The intractability of resolution, Theor. Comput. Sci. 39 (1985) 297-308.
22. J.N. Hooker, Resolution vs. cutting plane solution of inference problems: some computational experience, Oper. Res. Lett. 7 (1) (1988) 1-7.
23. J.N. Hooker and C. Fedjki, Branch-and-cut solution of inference problems in propositional logic, Ann. Math. Artif. Intell. 1 (1990) 123-139.
24. A.P. Kamath, N.K. Karmarker, K.G. Ramakrishnan and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, in: Proceedings Integer Programming and Combinatorial Optimization, Waterloo, Ont. (1990) 333-349.
25. A.P. Kamath, A. Motwani, R. Palem and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in: Proceedings FOCS-94 (1994).
26. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994) 1297-1301.
27. T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 3CNF formulas, in: Proceedings AAAI Spring Symposium on AI and NP-hard problems, Palo Alto, CA (1993).
28. D.G. Mitchell and H.J. Levesque, Some pitfalls for experimenters with random SAT, Artif. Intell. 81 111-125 (this volume).
29. D.G. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AAAI-92, San Jose, CA (1992) 459-465.
30. P. Purdom, A survey of average time analyses of satisfiability algorithms, J. Inform. Process. 13 (4) (1990).
31. B. Selman, Stochastic search and phase transitions: AI meets physics, in: Proceedings IJCAI-95, Montreal, Que. (1995).
32. B. Selman, H. Kautz and B. Cohen, Local search strategies for satisfiability testing, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science (ACM Press, Providence, RI, 1996); preliminary version in: Proceedings AAAI-94, Seattle, WA (1994) 337-343.
33. B. Selman, H. Kautz and B. Cohen, Local search strategies for satisfiability testing, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science (ACM Press, Providence, RI, 1996); preliminary version in: Proceedings AAAI-94, Seattle, WA (1994) 337-343.
34. B. Selman and S. Kirkpatrick, Critical behavior in the computational cost of satisfiability testing, Artif. Intell. 81 (1996) 273-295 (this volume).
35. B. Selman, H.J. Levesque and D.G. Mitchell, GSAT: a new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA (1992) 440-446.
36. A. Vellino, The complexity of automated reasoning, Ph.D. Thesis, Department of Philosophy, University of Toronto, Toronto, Ont. (1989).
37. C.P. Williams and T. Hogg, Using deep structure to locate hard problems, in: Proceedings AAAI-92, San Jose, CA (1992) 472-277.
38. L.C. Wu and C.Y. Tang, Solving the satisfiability problem by using randomized approach, Inform. Process. Lett. 41 (1992) 187-190.
39. R. Zabih and D. McAllester, A rearrangement search strategy for determining propositional satisfiability, in: Proceedings AAAI-88, St. Paul, MN (1988) 155-160.