Heuristics for dynamically adapting propagation

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 485-489

  Stergiou, Kostas ^a  

^a UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING;

ACTIVE CONSTRAINTS; ADAPTIVE CONSTRAINTS; BRANCHING HEURISTICS; CONSTRAINT PROGRAMMING; CONSTRAINT SOLVERS; HARD PART; LOCAL CONSISTENCY; SEARCH EFFORTS; VARIABLE ORDERING HEURISTICS; VARIABLES SELECTIONS;

CONSTRAINT THEORY;

EID: 85051948880     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-485     Document Type: Conference Paper

References (17)

1. J. Borrett, E Tsang, and N. Walsh, ‘Adaptive Constraint Satisfaction: The Quickest First Principle’, in ECAI-96, pp. 160–164, (1996).
2. F. Boussemart, F. Heremy, C. Lecoutre, and L. Sais, ‘Boosting systematic search by weighting constraints’, in ECAI-2004, pp. 482–486, (2004).
3. H. Cambazard and N. Jussien, ‘Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming’, Constraints, 11, 295–313, (2006).
4. A. Chmeiss and L. Sais, ‘Constraint Satisfaction Problems: Backtrack Search Revisited’, in ICTAI-2004, pp. 252–257, (2004).
5. R. Debruyne and C. Bessière, ‘From restricted path consistency to max-restricted path consistency’, in CP-97, pp. 312–326, (1997).
6. R. Debruyne and C. Bessière, ‘Domain Filtering Consistencies’, Journal of Artificial Intelligence Research, 14, 205–230, (2001).
7. A. Dempster, N. Laird, and D. Rubin, ‘Maximum Likelihood from Incomplete Data via the EM Algorithm’, Journal of the Royal Statistical Society, 39(1), 1–38, (1977).
8. H. El Sakkout, M. Wallace, and B. Richards, ‘An Instance of Adaptive Constraint Propagation’, in CP-96, pp. 164–178, (1996).
9. S. Epstein, E. Freuder, R. Wallace, A Morozov, and Samuels. B., ‘The Adaptive Constraint Engine’, in CP-2002, pp. 525–540, (2002).
10. E. Freuder and R.J. Wallace, ‘Selective relaxation for constraint satisfaction problems’, in ICTAI-96, (1996).
11. D. Grimes and R.J. Wallace, ‘Sampling Strategies and Variable Selection in Weighted Degree Heuristics’, in CP-2007, pp. 831–838, (2007).
12. 1st International Workshop on Autonomous Search (in conjunction with CP-07), eds., Y. Hamadi, E. Monfroy, and F. Saubion, 2007.
13. F. Laburthe and Ocre, ‘Choco: implementation du noyau d’un systeme de contraintes’, in JNPC-00, pp. 151–165, (2000).
14. D. Mehta and M.R.C. van Dongen, ‘Probabilistic Consistency Boosts MAC and SAC’, in IJCAI-2007, pp. 143–148, (2007).
15. S. Minton, ‘Automatically Configuring Constraint Satisfaction Programs: A Case Study’, Constraints, 1(1/2), 7–43, (1996).
16. P. Refalo, ‘Impact-based search strategies for constraint programming’, in CP-2004, pp. 556–571, (2004).
17. C. Schulte and P.J. Stuckey, ‘Speeding Up Constraint Propagation’, in CP-2004, pp. 619–633, (2004).