The backdoor key: A path to understanding problem hardness

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 118-123

  Ruan, Yongshao ^a   Kautz, Henry ^a   Horvitz, Eric ^b  

^a University of Washington   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING; KEY FRACTIONS; SEARCH ALGORITHMS; STRUCTURE DOMAINS;

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

COMPUTER SCIENCE;

EID: 9444264290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Achlioptas, D.; Gomes, C. P.; Kautz, H. A.; and Selman, B. 2000. Generating satisfi able problem instances. In AAAI/IAAI, 256-261.
2. Bayardo, R., and Schrag, R. 1997. Using csp look-back techniques to solve real-world sat instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 203-208. New Providence, RI: AAAI Press.
3. Cheeseman, P.; Kanefsky, B.; and Taylor, W. M. 1991. Where the Really Hard Problems Are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, Sidney, Australia, 331-337.
4. Culberson, J., and Gent, I. 2001. Frozen development in graph coloring. Theoretical Computer Science 265(1-2):227-264.
5. Gent, I. P.; MacIntyre, E.; Prosser, P.; and Walsh, T. 1996. The constrainedness of search. In AAAI/IAAI, Vol. 1, 246-252.
6. Gent, I. P.; Hoos, H. H.; Prosser, P.; and Walsh, T. 1999. Morphing: Combining structure and randomness. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), 654-660.
7. Gomes, C. P., and Selman, B. 1997. Problem Structure in the Presence of Perturbations. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 221-227. New Providence, RI: AAAI Press.
8. Gomes, C. P.; Selman, B.; and Kautz, H. 1998. Boosting Combinatorial Search Through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), 431-438. New Providence, RI: AAAI Press.
9. Kamath, A. P.; Karmarkar, N. K.; Ramakrishnan, K. G.; and Resende, M. G. C. 1993. An interior point approach to Boolean vector function synthesis. Proceedings of the 36th MSCAS 185-189.
10. Kautz, H., and Selman, B. 1996. Pushing the envelope: planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1188-1194. Portland, OR: AAAI Press.
11. Kautz, H.; Ruan, Y.; Achlioptas, D.; Gomes, C. P.; Selman, B.; and Stickel, M. 2001. Balance and fi ltering in structured satisfi able problems. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-01), 351-358.
12. Kirkpatrick, S., and Selman, B. 1994. Critical behavior in the satisfi ability of random Boolean expressions. Science 264:1297-1301.
13. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfi ability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, 366-371. AAAI Pess.
14. Mammen, D. L., and Hogg, T. 1997. A new look at the easy-hard-easy pattern of combinatorial search diffi culty. Journal of Artificial Intelligence Research 7:47-66.
15. Marques-Silva, J., and Sakallah, K. 1996. Grasp - a new search algorithm for satisfi ability. In Proceedings of the International Conference on Computer Aided Design, 220-227.
16. Mitchell, D. G.; Selman, B.; and Levesque, H. J. 1992. Hard and easy distributions for SAT problems. In Rosenbloom, P., and Szolovits, P., eds., Proceedings of the Tenth National Conference on Artificial Intelligence, 459-465. Menlo Park, California: AAAI Press.
17. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Effi cient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01).
18. Prosser, P. 1996. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence 81:81-109. www.satlib.org.
19. Singer, J.; Gent, I.; and Smaill, A. 2000. Backbone Fragility and the Local Search Cost Peak. Journal of Artificial Intelligence Research 12:235-270.
20. Slaney, J. K., and Walsh, T. 2001. Backbones in optimization and approximation. In IJCAI, 254-259.
21. Smith, B. 1994. Phase transition and the mushy region in constraint satisfaction problems. In In Proceedings of the eleventh European Conference on Artificial Intelligence, 100-104.
22. Williams, R.; Gomes, C.; and Selman, B. 2003a. Backdoors to typical case complexity. In IJCAI03.
23. Williams, R.; Gomes, C.; and Selman, B. 2003b. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In SAT03.
24. Zhang, L.; Madigan, C. F.; Moskewicz, M. W.; and Malik, S. 2001. Efficient confict driven learning in boolean satisfiability solver. In ICCAD, 279-285.
25. Zhang, H. 1997. SATO: an efficient propositional prover. In Proceedings of the International Conference on Automated Deduction (CADE'97), volume 1249 of LNAI, 272-275.