Statistical regimes across constrainedness regions

Constraints

Volumn 10, Issue 4, 2005, Pages 317-337

  Gomes, Carla P ^a   Fernández, Cèsar ^b   Selman, Bart ^a   Bessière, Christian ^c  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY OF LLEIDA   (Spain)

^c LIRMM   (France)

Author keywords

Backtrack search; Heavy tailed distributions; Phase transitions; Runtime distributions; Typical case analysis

Indexed keywords

CHARACTERIZATION; HARDNESS; PHASE TRANSITIONS; STATISTICAL METHODS;

BACKTRACK SEARCH; HEAVY-TAILED DISTRIBUTIONS; RUNTIME DISTRIBUTIONS; TYPICAL CASE ANALYSIS;

CONSTRAINT THEORY;

EID: 27244456154     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-005-2807-z     Document Type: Conference Paper

References (35)

1. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., & Stamatiou Y. (1997). Random constraint satisfaction: A more accurate picture. In Proceedings CP'97, Linz, Austria, pages 107-120.
2. Bayardo, R., & Miranker, D. (1996). A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 558-562. Portland, OR.
3. Berre, D. L., & Simon, L. (2004). Fifty-five solvers in Vancouver: The sat 2004 competition. In Proceedings of SAT'04.
4. Bessière, C., & Régin, J. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings CP'96, Cambridge, MA, pages 61-75.
5. Bessière, C., Zanuttini, B., & Fernández, C. (2004). Measuring search trees. In B. Hnich (ed.) Proceedings ECAI'04 Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain.
6. Chen, H., Gomes, C., & Selman, B. (2001). Formal models of heavy-tailed behavior in combinatorial search. In. Proceedings CP'01, Paphos, Cyprus, pages 408-421.
7. Dechter, R. (1990). Enhancement schemes for constraint processing: Back-jumping, learning and cutset decomposition. Artif. Intell. 41(3): 273-312.
8. Dechter, R. (2003). Constraint processing. Morgan Kaufmann.
9. Frost, D., Rish, I., & Vila, L. (1997). Summarizing CSP hardness with continuous probability distributions. In AAAI-97, Providence, Rhode Island, pages 327-333.
10. Gaschnig, J. (1977). A general backtrack algorithm that eliminates most redundant tests. In Proceedings IJCAI'77, Cambridge, MA, page 447.
11. Gent, I., & Walsh, T. (1994). Easy problems are sometimes hard. Artif. Intell. 70: 335-345.
12. Gomes, C., Selman, B., & Crato, N. (1997). Heavy-tailed distributions in combinatorial search. In Proceedings CP'97, Linz, Austria, pages 121-135.
13. Gomes, C. P., Selman, B., Crato, N., & Kautz, H. (2000). Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1-2): 67-100.
14. Haralick, R., & Elliot, G. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14: 263-313.
15. Hogg, T., Huberman, B., & Williams, C. (1996). Phase transitions and search problems. Artif. Intell. 81(1-2): 1-15.
16. Hogg, T., & Williams, C. (1994). The hardest constraint problems: A double phase transition. Artif. Intell. 69: 359-377.
17. Hoos, H. H., & Stützte, T. (2004). Stochastic Local Search: Foundations and Applications. Morgan Kaufmann.
18. Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., & Chickering, M. (2001). A Bayesian approach to tackling hard computational problems. In Proceedings of the Seventeenth Conference On Uncertainty in Artificial Intelligence (UAI-01).
19. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., & Selman, B. (2002). Dynamic restart policies. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), Edmonton, Canada.
20. Li, C., & Ambulagan. (1997). Heuristics based on unit propagation for satisfiability problems. In Proceedings IJCAI'97, Nagoya, Japan, pages 366-371.
21. Marques-Silva, J. P., & Sakallah, K. A. (1999). GRASP - A search algorithm for prepositional satisfiability. IEEE Trans. Comput. 48(5): 506-521.
22. Mohr, R., & Henderson, T. (1986). Arc and path consistency revisited. Artif. Intell. 28: 225-233.
23. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference, Las Vegas.
24. Nadel, B. (1989) Constraint satisfaction algorithms. Comput. Intell. 5: 188-224.
25. Prosser, P. (1993a). Domain filtering can degrade intelligent backtrack search. In Proceedings IJCAI'93, Chambry, France, pages 262-267.
26. Prosser, P. (1993b), Hybrid algorithms for the constraint satisfaction problem. Comput. Intell. 9(3): 268-299.
27. Rish, I., & Dechter, R. (2000). Resolution versus Search: Two strategies for SAT'. J. Autom. Reason. 24 (1/2): 225-275.
28. Sabin, D., & Freuder, E. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proceedings PPCP'94, Seattle, WA.
29. Selman, B., & Kirkpatrick, S. (1996). Finite-size scaling of the computational cost of systematic search. Artif. Intell. 81(1-2): 273-295.
30. Smith, B., & Grant, S. (1995). Sparse constraint graphs and exceptionally hard problems. In Proceedings IJCAI'95, Montral, Canada, pages 646-651.
31. Smith, B., & Grant, S. (1997). Modelling exceptionally hard constraint satisfaction problems. In Proceedings CP'97, Linz, Austria, pages 182-195.
32. Walsh, T. (2000) SAT vs CSP. In Proceedings CP'00, Singapore, pages 441-456.
33. Williams, R., Gomes, C., & Selman, B. (2003). Backdoors to Typical Case Complexity.
34. Williams, R., Gomes, C., & Selman, B. (2003). On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In Proceedings of Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT-03).
35. Xu, K., & Li, W. (2000). Exact phase transition in random constraint satisfaction problems. J. Artif. Intell. Res. 12: 93-103.