Learned value-ordering heuristics for constraint satisfaction

AAAI Workshop - Technical Report

Volumn WS-08-10, Issue , 2008, Pages 154-161

  Zhang, Zhijun ^a   Epstein, Susan L ^a,b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; COMPUTATIONAL COSTS; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; EMPIRICAL RESULTS; GLOBAL SEARCH; LOOK-AHEAD; VARIABLE ORDERING HEURISTICS;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; STEELMAKING;

HEURISTIC METHODS;

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

References (33)

1. Bayardo Jr., R. J., and Schrag, R. 1996. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. In Proceedings of CP-1996, 46-60.
2. Beck, J. C. 2007. Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. JAIR 29: 49-77
3. Bessiére, C. and Cordier M. O. 1993. Arc-Consistency and Arc-Consistency Again. Artificial Intelligence 65: 179-190.
4. Bessiére, C.; Freuder, E. C.; and Régin, J. C. 1999. Using Constraint Metaknowledge to Reduce Arc Consistency Computation. Artificial Intelligence 107: 125-148.
5. Bessiére, C, and Régin, J. C. 1996. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In Proceedings of CP-1996, 61-75.
6. Bessiére, C, and Régin, J. C. 2001. Refining the Basic Constraint Propagation Algorithm. In Proceedings of IJCAI-2001, 309-315.
7. Bessiére, C.; Régin, J. C.; Yap, R. H. C.; and Zhang, Y. 2005. An Optimal Coarse-Grained Arc Consistency Algorithm. Artificial Intelligence 165: 165-185.
8. Boussemart, F.; Hemery, F.; Lecoutre, C.; and Sais, L. 2004. Boosting Systematic Search by Weighting Constraints. In Proceedings of ECAI-2004, 146-150.
9. Debruyne, R., and Bessiére, C. 1997. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In Proceedings of IJCAI-1997, 412-417.
10. Dechter, R., and Pearl, J. 1988. Network-based Heuristics for Constraint Satisfaction Problems. Artificial Intelligence 34: 1-38.
11. Epstein, S. L.; Freuder, E. C.; and Wallace, R. L. 2005. Learning to Support Constraint Programmers. Computational Intelligence 21: 337-371.
12. Frost, D., and Dechter, R. 1995. Look-ahead Value Ordering for Constraint Satisfaction Problems. In Proceedings of IJCAI-1995, 572-578.
13. Geelen, P. A. 1992. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In Proceedings of ECAI-1992, 31-35.
14. Gent, I. P.; MacIntyre, E.; Prosser, P.; and Walsh, T. 1996. The Constrainedness of Search. In Proceedings of AAAI-1996, 246-252.
15. Ginsberg, M.; Frank, M.; Halpin, M.; and Torrance, M. 1990. Search Lessons Learned from Crossword Puzzles. In Proceedings of AAAI-1990, 210-215.
16. Golomb, S., and Baumert, L. 1965. Backtracking Programming Journal of the A CM 12: 516-52.
17. Gomes, C.; Fernandez, C.; Selman, B.; and Bessiere, C. 2004. Statistical Regimes Across Constrainedness Regions. In Proceedings of CP-2004, 32-46, Springer.
18. Harvey, W. D. 1995. Nonsystematic Backtracking Search. PhD Thesis, Stanford University (1995).
19. Harvey, W. D., and Ginsberg, M. L. 1995. Limited Discrepancy Search. In Proceedings of IJCAI-1995, 607-613.
20. Hulubei, T., and O'Sullivan, B. 2005. Search Heuristics and Heavy-Tailed Behavior. In Proceedings of CP-2005, 328-342.
21. Kask, K.; Dechter, R.; and Gogate, V. 2004. Counting-Based Look-Ahead Schemes for Constraint Satisfaction. In Proceedings of CP-2004, 317-331.
22. Lecoutre, C.; Sais, L.; Tabary, S.; and Vidal, V. 2007. Nogood Recording from Restarts. In Proceedings of IJCAI-2007, 131-136.
23. Mackworth, A. K. 1977. Consistency in Networks of Relations. Artificial Intelligence 8: 99-118.
24. Mehta, D., and von Dongen, M.R.C. 2005. Static Value Ordering Heuristics for Constraint Satisfaction Problems. In Proceedings of CPAI-2005, 49-62.
25. Meisels, A.; Shimony, S. E.; and Solotorevsky, G. 1997. Bayes Networks for Estimating the Number of Solutions to a CSP. In Proceedings of AAAI-1997, 185-190.
26. Meseguer, P., and Walsh, T. 1998. Interleaved and Discrepancy Based Search. In Proceedings of ECAI-1998, 239-243.
27. Minton, S. 1996. Automatically Configuring Constraint Satisfaction Programs: A Case Study. Constraints 1: 7-44.
28. Refalo, P. 2004. Impacted-Based Search Strategies for Constraint Programming. Proceedings of CP-2004, 557-571.
29. Walsh, T. 1997. Depth-bounded Discrepancy Search, In Proceedings of IJCAI-1997, 1388-1393.
30. Sabin, D., and Freuder, E. C. 1994. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proceedings of ECAI-1994, 125-129.
31. Smith, B. M., and Sturdy, P. 2005. Value Ordering for Finding All Solutions. In Proceedings of IJCAI-2005, 311-316.
32. Vernooy, M., and Harvens, W. S. 1999. An Evaluation of Probabilistic Value-Ordering Heuristics, in Proceedings of the Australian Conference on Artificial Intelligence, 340-352.
33. Zanarini, A., and Pesant, G. 2007. Solution Counting Algorithms for Constraint-Centered Search Heuristics. In of CP-2007, 743-757.