Learning implied global constraints

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 44-49

  Bessiere, Christian ^a   Coletta, Remi ^b   Petit, Thierry ^c  

^a LIRMM   (France)

^b LRD   (France)

^c ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC REFORMULATIONS; CONSTRAINT NETWORKS; CONSTRAINT PROGRAMMING; CONSTRAINT SOLVERS; GLOBAL CARDINALITY CONSTRAINT; GLOBAL CONSTRAINTS;

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING;

CONSTRAINT THEORY;

EID: 77958467084     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97-123, 1994.
2. N. Beldiceanu, M. Carlsson, and J-X. Rampon. Global constraint catalog. SICS Technical report T2005-08, URL: http://www.sics.se/libindex.html#Technical, 2005.
3. C. Bessiere, R. Coletta, and T. Petit. Acquiring parameters of implied global constraints. Proceedings CP, pages 747-751, 2005.
4. C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Among, common and disjoint constraints. In CSCLP: Recent Advances in Constraints, volume 3978 of LNCS, pages 29-43. Springer, 2006.
5. Choco. A Java library for constraint satisfaction problems, constraint programming and explanation-based constraint solving. URL: http://sourceforge. net/projects/choco, 2005.
6. S. Colton and I. Miguel. Constraint generation via automated theory formation. Proceedings CP, pages 575-579, 2001.
7. B. Hnich, J. Richardson, and P. Flener. Towards automatic generation and evluation of implied constraints. Upsala University T.R., 2001.
8. Ilog. Solver 5.0 User's Manual. URL: http://www.ilog.fr, 2000.
9. J.F. Puget. Constraint programming next challenge: Simplicity of use. Proceedings CP, pages 5-8, 2004.
10. C.-G. Quimper, P. Van Beek, A. Lopez-Ortiz, A. Golynski, and S. B. Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint. Proceedings CP, pages 600-614, 2003.
11. C.-G. Quimper, A. López-Ortiz, P. van Beek, and A. Golynski. Improved algorithms for the global cardinality constraint. Proceedings CP, 2004.
12. J-C. Régin. Generalized arc consistency for global cardinality constraint. Proceedings AAAI, pages 209-215, 1996.
13. J-C. Régin. Minimization of the number of breaks in sports scheduling problems using constraints programming. DIMACS series in Discrete Mathematics and Theoretical Computer Science, 57:115-130, 2001.
14. B. Smith, K. Stergiou, and T. Walsh. Modelling the golomb ruler problem. In J.C. Régin and W. Nuijten, editors, Proceedings IJCAI'99 workshop on non-binary constraints, Stockholm, Sweden, 1999.
15. L. Sterling, A. Bundy, L. Byrd, R. O'Keefe, and B. Silver. Solving symbolic equations with PRESS. Journal of Symbolic Computation, pages 71-84, 1989.