Guiding search using constraint-level advice

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 158-162

  Szymanek, Radoslaw ^a   O'Sullivan, Barry ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BACKTRACK SEARCH; CONSTRAINT-SATISFACTION PROBLEMS; GOOD VARIABLES; SEARCH EFFORTS; SEARCH PROCESS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84862705421     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. N. Beldiceanu, 'Global constraints as graph properties on structured networks of elementary constraints of the same type', Technical Report T2000-01, SICS, (January 2000).
2. C. Bessiere and J-C. Regin, 'MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems', in Proceedings of CP-1996, LNCS 1118, pp. 61-75, (1996).
3. C. Bessiere, B. Zanuttini, and C. Fernandez, 'Measuring search trees', in Proceedings ECAI'04 workshop on Modelling and Solving Problems with Constraints, pp. 31-40, (2004).
4. S. Bourdais, P. Galinier, and G. Pesant, 'Hibiscus: A constraint programming application to staff scheduling in health care.', in Proceedings of CP-2003, LNCS 2833, pp. 153-167, (2003).
5. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, 'Boosting systematic search by weighting constraints', in Proceedings of ECAI-2004, pp. 146-150, (2004).
6. D. Brélaz, 'New methods to color the vertices of a graph', Communications of the ACM, 22(4), 251-256, (1979).
7. B. M.W. Cheng, Kenneth M. F. Choi, Jimmy Ho-Man Lee, and J. C. K. Wu, 'Increasing constraint propagation by redundant modeling: an experience report.', Constraints, 4(2), 167-192, (1999).
8. S. Demassey, G. Pesant, and L.-M. Rousseau, 'Constraint programming based column generation for employee timetabling.', in CPAIOR, pp. 140-154, (2005).
9. P. A. Geelen, 'Dual viewpoint heuristics for binary constraint satisfaction problems.', in ECAI, pp. 31-35, (1992).
10. R.M. Haralick and G.L. Elliott, 'Increasing tree search efficiency for constraint satisfaction problems', Artif. Intell., 14(4), 263-313, (1980).
11. B. Hnich, B.M. Smith, and T. Walsh, 'Dual modelling of permutation and injection problems.', J. Artif. Intell. Res., 21, 357-391, (2004).
12. K. Kuchcinski, 'Constraints-driven scheduling and resource assignment', ACM Transactions on Design Automation of Electronic Systems (TODAES), 8(3), 355-383, (July 2003).
13. D.G. Mitchell, 'Resolution and constraint satisfaction.', in Proceedings of CP-2003, LNCS 2833, pp. 555-569, (2003).
14. G. Pesant, 'Counting solutions to CSPs: A structural approach', in Proceedings of IJCAI-2005, pp. 260-265, (2005).
15. J.-F. Puget. The next challenge for CP: Ease of use. Invited Talk at CP-2004.
16. P. Refalo, 'Impact-based search strategies for constraint programming', in Proc. of Principles and Practice of Constraint Programming (CP), volume 3258, pp. 557-571, (2004).
17. J-C. Regin, 'A filtering algorithm for constraints of difference in CSPs', in Proc. of AAAI, volume 1, pp. 362-367, (1994).
18. B.M. Smith and P. Sturdy, 'Value ordering for finding all solutions.', in IJCAI, pp. 311-316, (2005).
19. M. Wallace, 'Practical applications of constraint programming', Constraints, 1(1-2), 139-168, (1996).