Some pitfalls for experimenters with random SAT

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 111-125

  Mitchell, David G ^a   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Experimental design; Phase transitions; Random problems; Satisfiability

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOM PROBLEMS; SATISFIABILITY PROBLEMS; SEARCH PHASE TRANSITIONS;

ARTIFICIAL INTELLIGENCE;

EID: 0030105625     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00049-6     Document Type: Article

References (27)

1. B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inf. Process. Lett. 8 (3) (1979) 121-123.
2. 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) 289-314.
3. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney, Australia (1991).
4. J.M. Crawford and L.D. Auton, Experimental results on the cross-over point in satisfiability problems, in: Proceedings AAAI-93, Washington, DC (1993) 21-29.
5. J.M. Crawford and A.B. Baker, Experimental results on the application of satisfiability algorithms to scheduling problems, in: Proceedings AAAI-94, Seattle, WA (1994).
6. A. d'Anjou M. Graña, F.J. Torrealdea and M.C. Hernandez, Solving satisfiability via Boltzmann Machines, IEEE Trans. Pattern Anal. Mach. Intell. 15 (5) (1993).
7. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Commun. ACM 5 (1962) 394-397.
8. M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
9. J. Franco, On the probabilistic performance of algorithms for the satisfiability problem, Inf. Process. Lett. 23 (1986) 103-106.
10. A. Frieze and S. Suen, Analysis of three simple heuristics on a random instance of k-SAT, Manuscript (1992).
11. G. Gallo and G. Urbani, Algorithms for testing the satisfiability of prepositional formulae, J. Logic Program. 7 (1989) 45-61.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
13. I.P. Gent and T. Walsh, The hardest random SAT problems, in: Proceedings KI-94 (1994).
14. I.P. Gent and T. Walsh, The SAT phase transition, in: Proceedings ECAI-94, Amsterdam (1994).
15. A. Goldberg, On the complexity of the satisfiability problem, Courant Computer Science Report No. 16, New York University (1979).
16. J. Gu, Efficient local search for very large-scale satisfiability problems, SIGART Bull. 3 (1) (1992) 8-12.
17. J.N. Hooker, Resolution vs. cutting plane solution of inference problems: some computational experience, Oper. Res. Lett. 7 (1) (1988) 1-7.
18. A. Kamath, N.K. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, in: Integer Programming and Combinatorial Optimization. (Mathematical Programming Society, 1990) 333-349.
19. A. Kamath, R. Motwani, K. Palem and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in: Proceedings FOCS-94 (1994).
20. K. Konolige, Easy to be hard: difficult problems for greedy algorithms, in: Proceedings KR-94, Bonn, Germany (1994) 374-378.
21. T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 3CNF formulas, Tech. Report UCSC-CRL-92-42 CRL, University of California, Santa Cruz, CA (1992).
22. P. Purdom, A survey of average time analyses of satisfiability algorithms, J. Inf. Process. 13 (4) (1990).
23. B. Selman, H. Kautz and B. Cohen, Noise strategies for improving local search, in: Proceedings AAAI-94, Seattle, WA (1994) 337-343.
24. B. Selman and S. Kirkpatrick, Critical behavior in the computational cost of satisfiability testing, Artif. Intell. 81 (1996) 273-295 (this volume).
25. B. Selman, H.J. Levesque and D.G. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA (1992) .
26. B. Selman, D.G. Mitchell and H.J. Levesque, Generating hard satisfiability problems, Artif. Intell. 81 (1996) 17-29 (this volume).
27. L. Wu and C.Y. Tang, Solving the satisfiability problem by using randomized approach, Inf. Process. Lett. 41 (1992) 187-190.