Heuristics for dynamically adapting propagation in constraint satisfaction problems

AI Communications

Volumn 22, Issue 3, 2009, Pages 125-141

  Stergiou, Kostas ^a  

^a UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

Constraint programming; Constraint propagation; Search

Indexed keywords

ADAPTIVE CONSTRAINTS; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; CONSTRAINT PROPAGATION TECHNIQUE; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT SOLVERS; EXPERIMENTAL STUDIES; HEURISTIC APPROACH; LOCAL CONSISTENCY; PROBLEM-BASED; PROPAGATION METHOD; SEARCH; SEARCH SPACES; STRUCTURED PROBLEMS;

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

HEURISTIC METHODS;

EID: 70349119049     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2009-0450     Document Type: Article

References (30)

1. C. Bessiere, Constraint propagation, in: Handbook of Constraint Programming, F. Rossi, P. van Beek and T. Walsh, eds, Elsevier, Amsterdam, The Netherlands, 2006, Chapter 3.
2. C. Bessière and J.C. Régin, MAC and combined heuristics: two reasons to forsake FC (and CBJ?), in: Proceedings of CP-1996, Cambridge, MA, 1996, pp. 6175.
3. C. Bessière, J.C. Régin, R. Yap and Y. Zhang, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence 165(2) (2005), 165185.
4. C. Bessiere, K. Stergiou and T. Walsh, Domain filtering consistencies for non-binary constraints, Artificial Intelligence 172(6/7) (2008), 800822.
5. J. Borrett, E. Tsang and N.Walsh, Adaptive constraint satisfaction: The quickest first principle, in: ECAI-96, Budapest, Hungary, 1996, pp. 160164.
6. F. Boussemart, F. Heremy, C. Lecoutre and L. Sais, Boosting systematic search by weighting constraints, in: ECAI-2004, Valencia, Spain, 2004, pp. 482486.
7. B. Cabon, S. De Givry, L. Lobjois, T. Schiex and J.P. Warners, Radio link frequency assignment, Constraints 4 (1999), 7989.
8. H. Cambazard and N. Jussien, Identifying and exploiting problem structures using explanation-based constraint programming, Constraints 11 (2006), 295313.
9. A. Chmeiss and L. Sais, Constraint satisfaction problems: Backtrack search revisited, in: ICTAI-2004, Boca Raton, FL, USA, 2004, pp. 252257.
10. R. Debruyne and C. Bessière, From restricted path consistency to max-restricted path consistency, in: CP-97, Linz, Austria, 1997, pp. 312326.
11. R. Debruyne and C. Bessière, Domain filtering consistencies, Journal of Artificial Intelligence Research 14 (2001), 205230.
12. A. Dempster, N. Laird and D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society 39(1) (1977), 138.
13. H. El Sakkout, M. Wallace and B. Richards, An instance of adaptive constraint propagation, in: CP-96, Cambridge, MA, USA, 1996, pp. 164178.
14. S. Epstein, E. Freuder, R. Wallace, A. Morozov and B. Samuels, The adaptive constraint engine, in: CP-2002, Ithaca, NY, USA, 2002, pp. 525540.
15. E. Freuder and R.J. Wallace, Selective relaxation for constraint satisfaction problems, in: ICTAI-96, Toulouse, France, 1996.
16. D. Grimes and R.J. Wallace, Sampling strategies and variable selection in weighted degree heuristics, in: CP-2007, Providence, RI, USA, 2007, pp. 831838.
17. Y. Hamadi, E. Monfroy and F. Saubion (eds), in: 1st International Workshop on Autonomous Search (in conjunction with CP-07), Providence, RI, USA, 2007.
18. F. Laburthe and OCRE, Choco: implementation du noyau d?un systeme de contraintes, in: JNPC-00, Marseille, France, 2000, pp. 151165.
19. A. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977), 99118.
20. D. Mehta and M.R.C. van Dongen, Probabilistic consistency boosts MAC and SAC, in: IJCAI-2007, Hyderabad, India, 2007, pp. 143148.
21. S. Minton, Automatically configuring constraint satisfaction programs: A case study, Constraints 1(1/2) (1996), 743.
22. P. Refalo, Impact-based search strategies for constraint programming, in: CP-2004, Toronto, ON, Canada, 2004, pp. 556571.
23. D. Sabin and E.C. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: Proceedings of CP?94, Washington, DC, USA, 1994, pp. 1020.
24. C. Schulte and P.J. Stuckey, Speeding up constraint propagation, in: CP-2004, Toronto, ON, Canada, 2004, pp. 619633.
25. C. Schulte and P.J. Stuckey, Efficient constraint propagation engines, ACM Trans. Progr. Lang. Syst. 31(1) (2008), 143.
26. K. Stergiou, Heuristics for dynamically adapting propagation, in: ECAI-2008, Patras, Greece, 2008, pp. 485489.
27. R. Szymanek and C. Lecoutre, Constraint-level advice for shaving, in: ICLP-2008, Udine, Italy, 2008, pp. 636650.
28. P. van Beek, Backtracking search algorithms, in: Handbook of Constraint Programming, F. Rossi, P. van Beek and T. Walsh, eds, Elsevier, Amsterdam, The Netherlands, 2006, Chapter 4.
29. W. van Hoeve and I. Katriel, Global constraints, in: Handbook of Constraint Programming, F. Rossi, P. van Beek and T. Walsh, eds, Elsevier, Amsterdam, The Netherlands, 2006, Chapter 5.
30. R.Wallace and D. Grimes, Experimental studies of variable selection strategies based on constraint weights, Journal of Algorithms 63(13) (2008), 114129.