Constraint-level advice for shaving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5366 LNCS, Issue , 2008, Pages 636-650

  Szymanek, Radoslaw ^a   Lecoutre, Christophe ^b  

^a EPFL   (Switzerland)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; INFORMATION THEORY; PROGRAMMING THEORY; SEMANTICS;

CONSTRAINT MODELLING; CONSTRAINT SOLVERS; EXECUTION TIME; PROBLEM CLASSES;

LOGIC PROGRAMMING;

ALLDIFFERENT; AVERAGE EXECUTION TIME; CONSTRAINT MODEL; CONSTRAINT SOLVERS; GLOBAL CONSTRAINTS; ORDERS OF MAGNITUDE;

EID: 58549089955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_52     Document Type: Conference Paper

References (22)

1. Wallace, M.: Practical applications of constraint programming. Journal of Constraints 1, 139-168 (1996)
2. Puget, J.: The next challenge for CP: Ease of use. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 5-8. Springer, Heidelberg (2004)
3. Carlier, J., Pinson, E.: Adjustments of heads and tails for the job-shop problem. European Journal of Operational Research 78, 146-161 (1994)
4. Martin, P., Shmoys, D.: A new approach to computing optimal schedules for the job-shop scheduling problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 389-403. Springer, Heidelberg (1996)
5. Lhomme, O.: Quick shaving. In: Proceedings of AAAI 2005, pp. 411-415 (2005)
6. Debruyne, R., Bessiere, C.: Some practical filtering techniques for the constraint satisfaction problem. In: Proceedings of IJCAI 1997, pp. 412-417 (1997)
7. Hnich, B., Richardson, J., Flener, P.: Towards automatic generation and evaluation of implied constraints. Technical Report 2003-014, Uppsala Universitet (2003)
8. Bessiere, C., Coletta, R., Petit, T.: Learning implied global constraints. In: Proceedings of IJCAI 2007, pp. 50-55 (2007)
9. Regin, J.: Combination of among and cardinality constraints. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 288-303. Springer, Heidelberg (2005)
10. Debruyne, R., Bessiere, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research 14, 205-230 (2001)
11. Bessiere, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artificial Intelligence (to appear, 2008)
12. Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
13. Bartak, R., Erben, R.: A new algorithm for singleton arc consistency. In: Proceedings of FLAIRS 2004 (2004)
14. Bessiere, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. Proceedings of IJCAI 2005, 54-59 (2005)
15. Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Proceedings of IJCAI 2005, pp. 199-204 (2005)
16. Lecoutre, C., Prosser, P.: Maintaining singleton arc consistency. In: Proceedings of CPAI 2006 workshop held with CP 2006, pp. 47-61 (2006)
17. Hwang, J., Mitchell, D.: 2-way vs d-way branching for CSP. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 343-357. Springer, Heidelberg (2005)
18. Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of CP 1994, pp. 10-20 (1994)
19. Bessiere, C., Zanuttini, B., Fernandez, C.: Measuring search trees. In: Proceedings of ECAI 2004 workshop on Modelling and Solving Problems with Constraints, pp. 31-40 (2004)
20. Schulte, C., Carlsson, M.: Finite domain constraint programming systems. In: Handbook of Constraint Programming, pp. 495-526. Elsevier, Amsterdam (2006)
21. Regin, J.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994, pp. 362-367 (1994)
22. Kuchcinski, K.: Constraints-driven scheduling and resource assignment. ACM Transactions on Design Automation of Electronic Systems 8, 355-383 (2003)