Understanding random SAT: Beyond the clauses-to-variables ratio

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 438-452

  Nudelman, Eugene ^a   Leyton Brown, Kevin ^b   Hoos, Holger H ^b   Devkar, Alex ^a   Shoham, Yoav ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ALGORITHM PORTFOLIOS; DIFFERENT DISTRIBUTIONS; HIGHLY-CORRELATED; RANDOM K-SAT; SAT INSTANCES; SAT SOLVERS; UNIFORM RANDOM 3-SAT;

LEARNING SYSTEMS;

EID: 33847303915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_33     Document Type: Article

References (18)

1. Fahiem Bacchus and Jonathan Winter. Effective preprocessing with hyper-resolution and equality reduction. In Proc. SAT-2003, pages 341-355, 2003.
2. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the Really Hard Problems Are. In Proc. IJCAI-1991, pages 331-337, 1991.
3. C. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning, 24(1):67-100, 2000.
4. H. H. Hoos and T. Stützle. Stochastic Local Search - Foundations and Applications. Morgan Kaufmann, 2004 (to appear).
5. H.H. Hoos. SAT-encodings, search space structure, and local search performance. In Proc. IJCAI-99, pages 296-302. Morgan Kaufmann, 1999.
6. H.H. Hoos and T. Stützle. Towards a characterisation of the behaviour of stochastic local search algorithms for sat. Artificial Intelligence, 112:213-232, 1999.
7. E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, and M. Chickering. A Bayesian approach to tackling hard computational problems. In Proc. UAI-2001, pages 235-244, 2001.
8. Phokion Kolaitis. Constraint satisfaction, databases and logic. In Proc. IJCAI-2003, pages 1587-1595, 2003.
9. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. Boosting as a metaphor for algorithm design. In Proc. CP-2003, pages 899-903, 2003.
10. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. A portfolio approach to algorithm selection. In Proc. IJCAI-2003, pages 1542-1542, 2003.
11. K. Leyton-Brown, E. Nudelman, and Y. Shoham. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Proc. CP-2002, pages 556-572, 2002.
12. L. Lobjois and M. Lemaître. Branch and bound algorithm selection by performance prediction. In Proc. AAAI-1998, pages 353-358, 1998.
13. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 400:133-137, 1999.
14. Y. Ruan, E. Horvitz, and H. Kautz. Restart policies with dependence among runs: A dynamic programming approach. In Proc CP2-2002, pages 573-586, 2002.
15. B. Selman, D.G. Mitchell, and H.J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996.
16. R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal Statist. Soc B, 58(1):267-288, 1996.
17. D. Tompkins and H. Hoos. UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In Proc. SAT-2004, pages 37-46, 2004.
18. R. Williams, C. Gomes, and B. Selman. Backdoors to typical case complexity. In Proc. IJCAI-2003, pages 1173-1178, 2003.