Boosting systematic search by weighting constraints

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 146-150

  Boussemart, Frédéric ^a   Hemery, Fred ^a   Lecoutre, Christophe ^a   Sais, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY;

'CURRENT; CONSTRAINT-SATISFACTION PROBLEMS; DEAD-ENDS; HARD PART; REAL-WORLD; SEARCH PROCESS; SYSTEMATIC SEARCHES; VARIABLE ORDERING HEURISTICS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85017395931     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (27)

1. F. Bacchus, 'Extending forward checking', in Proceedings of CP'00, pp. 35-51, (2000).
2. M. Beresin, E. Levin, and J. Winn, A chessboard coloring problem, The College Mathematics Journal, 20(2), 106-114, (1989).
3. C. Bessiere, A. Chmeiss, and L. Sais, 'Neighborhood-based variable ordering heuristics for the constraint satisfaction problem', in Proceedings of CP'01, pp. 565-569, (2001).
4. C. Bessiere and J. Regin, MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, in Proceedings of CP'96, pp. 61-75, (1996).
5. D. Brelaz, 'New methods to color the vertices of a graph', Communications of the ACM, 22, 251-256, (1979).
6. L. Brisoux, E. Gregoire, and L. Sais, 'Improving backtrack search for sat by means of redundancy', in Proceedings of ISMIS'99, pp. 301-309, (1999).
7. R. Bruni and A. Sassano, 'Detecting minimaly unsatisfiable subformulae in unsatisfiable SAT instances by means of adaptative core search', in Proceedings of SAT'00, (2000).
8. X. Chen and P. van Beek, Conflict-directed backjumping revisited, Journal of Artificial Intelligence Research, 14, 53-81, (2001).
9. R. Dechter and D. Frost, 'Backjump-based backtracking for constraint satisfaction problems', Artificial Intelligence, 136, 147-188, (2002).
10. R. Dechter and I. Meiri, 'Experimental evaluation of preprocessing techniques in constraint satisfaction problems', in Proceedings of IJCAI' 89, pp. 271-277, (1989).
11. E.C. Freuder, 'A sufficient condition for backtrack-free search', Journal of the ACM, 29(1), 24-32, (1982).
12. D. Frost and R. Dechter, 'Look-ahead value ordering for constraint satisfaction problems', in Proceedings of IJCAI'95, pp. 572-578, (1995).
13. I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh, 'An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem', in Proceedings of CP'96, pp. 179-193, (1996).
14. C.P. Gomes, B. Selman, N. Crato, and H. Kautz, 'Heavy-tailed phenomena in satisfiability and constraint satisfaction problems', Journal of Automated Reasoning, 24, 67-100, (2000).
15. C.P. Gomez and D. Shmoys, 'Completing quasigroups or latin squares: A structured graph coloring problem', in Proceedings of Computational Symposium on Graph Coloring and Generalization, (2002).
16. R.M. Haralick and G.L. Elliott, 'Increasing tree search efficiency for constraint satisfaction problems', Artificial Intelligence, 14, 263-313, (1980).
17. M.C. Horsch and W.S. Havens, 'An empirical study of probabilistic arc consistency as a variable ordering heuristic', in Proceedings of CP'00, pp. 525-530, (2000).
18. N. Jussien, R. Debruyne, and P. Boizumault, Maintaining arcconsistency within dynamic backtracking, in Proceedings of CP'00, pp. 249-261, (2000).
19. C. Lecoutre, F. Boussemart, and F. Hemery, Exploiting multidirectionality in coarse-grained arc consistency algorithms, in Proceedings of CP'03, pp. 480-494, (2003).
20. B. Mazure, L. Sais, and E. Gregoire, Boosting complete techniques thanks to local search methods, Annals of Mathematics and Artificial Intelligence, 22, 319-331, (1998).
21. P. Morris, The breakout method for escaping from local minima, in Proceedings of AAAI'93, pp. 40-45, (1993).
22. N. Sadeh and M.S. Fox, Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem, Artificial Intelligence, 86, 1-41, (1996).
23. B. Selman and H. Kautz, Domain-independent extensions to gsat: solving large structured satisfiability problems, in Proceedings of IJCAI' 93, pp. 290-295, (1993).
24. B.M. Smith, The brelaz heuristic and optimal static orderings, in Proceedings of CP'99, pp. 405-418, Alexandria, VA, (1999).
25. B.M. Smith and S.A. Grant, Trying harder to fail first, in Proceedings of ECAI'98, pp. 249-253, Brighton, UK, (1998).
26. J.R. Thornton, Constraint weighting local search for constraint satisfaction, Ph.D. dissertation, Griffith University, Australia, 2000.
27. R. Williams, C.P. Gomes, and B. Selman, 'Backdoors to typical case complexity', in Proceedings of IJCAI'03, (2003).