Experimental results on the crossover point in random 3-SAT

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 31-57

  Crawford, James M ^a   Auton, Larry D ^b  

^a UNIVERSITY OF OREGON   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Crossover point in random 3 SAT; Experimental analysis of 3 SAT; Satisfiability; Search phase transition

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FUNCTIONS; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

CROSSOVER POINT; SATISFIABILITY PROBLEM; SEARCH PHASE TRANSITION;

ARTIFICIAL INTELLIGENCE;

EID: 0030108241     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00046-1     Document Type: Article

References (19)

1. 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).
2. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney, Australia (1991) 163-169.
3. V. Chvátal and E. Szemerédi, Many hard examples for resolution, J. ACM 35 (4) (1988) 759-768.
4. J.M. Crawford and L.D. Auton, Experimental results on the crossover point in satisfiability problems, in: Proceedings AAAI-93, Washington, DC (1993) 21-27.
5. M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, Commun. ACM 5 (1962) 394-397.
6. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 3 (1984) 267-284.
7. O. Dubois, P. Andre, Y. Boufkhad and J. Carlier, SAT versus UNSAT, in: Proceedings Second DIMACS Challenge: Cliques, Coloring and Satisfiability, Rutgers University, NJ (1993).
8. J.W. Freeman, Improvements to propositional satisfiability search algorithms, Doctoral Dissertation, University of Pennsylvania, Philadelphia, PA (1994).
9. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, New York, 1979).
10. I.P. Gent and T. Walsh, Easy problems are sometimes hard, Artif. Intell. 70 (1994) 335-345.
11. T. Hogg and C.P. Williams, The hardest constraint problems: a double phase transition. Artif. Intell. 69 (1994) 359-377.
12. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random boolean expressions, Science 264 (1994) 1297-1301.
13. T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 2CNF formulas, in: Working Notes AAAI Spring Symposium on AI and NP-Hard Problems, Stanford, CA (1993).
14. S. Minton, M.D. Johnson, A.B. Philips and P. Laird, Solving large-scale constraint-satisfaction and scheduling problems using a heuristic repair method, in: Proceedings AAAI-90, Boston, MA (1990) 17-24.
15. D. Mitchell, An empirical study of random SAT, Master's Thesis, Department of Computing Science, Simon Fraser University, Vancouver, BC (1993).
16. D. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AAAI-92, San Jose, CA (1992) 459-465.
17. B. Selman, H.J. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA (1992) 440-446.
18. R.M. Smullyan, First Order Logic (Springer-Verlag, New York, 1968).
19. R.D. Zabih and D.A. McAllester, A rearrangement search strategy for determining propositional satisfiability, in: Proceedings AAAI-88, St. Paul, MN (1988) 155-160.