The tractability of global constraints

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

Volumn 3258, Issue , 2004, Pages 716-720

  Bessiere, Christian ^a   Hebrard, Emmanuel ^b   Hnich, Brahim ^b   Walsh, Toby ^b  

^a LIRMM   (France)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY;

BACKTRACKING SEARCH; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; FAST ALGORITHMS; FINITE-DOMAIN VARIABLES; GLOBAL CONSTRAINTS; SEARCH SPACES;

COMPUTER PROGRAMMING;

EID: 35048817043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_53     Document Type: Article

References (8)

1. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. SICS Technical Report T2000/01.
2. N. Beldiceanu and M. Carlsson. Revisiting the cardinality operator and introducing cardinality-path constraint family. In Proceedings ICLP'01, pages 59-73, 2001.
3. C. Bessiere, E. Hebrard, , B. Hnich, and T. Walsh. The tractability of global constraints. Technical Report APES-83-2004, APES Research Group, May 2004.
4. C. Bessiere and J.C. Régin. Arc consistency for general constraint networks: Preliminary results. In Proceedings IJCAI'97, pages 398-104, 1997.
5. R. Mohr and G. Masini. Good old discrete relaxation. In Proceedings ECAI'88, pages 651-656, 1988.
6. F. Pachet and P. Roy. Automatic generation of music programs. In Proceedings CP'99, pages 331-345, 1999.
7. C. Quimper. Enforcing domain consistency on the extended global cardinality constraint is NP-hard. TR CS-2003-39, School of Computer Science, University of Waterloo, 2003.
8. J-C. Régin. Generalized are consistency for global cardinality constraints. In Proceedings AAAI'96, pages 209-215, 1996.