The range and roots constraints: Specifying counting and occurrence problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 60-65

  Bessiere, Christian ^a   Hebrard, Emmanuel ^b   Hnich, Brahim ^c   Kiziltan, Zeynep ^d   Walsh, Toby ^b  

^a LIRMM   (France)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c UNIVERSITY COLLEGE CORK   (Ireland)

^d UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARC-CONSISTENCY; DECLARATIVE LANGUAGES; GLOBAL CONSTRAINTS; NP-HARD; POLYNOMIAL-TIME; PROPAGATION ALGORITHM;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; POLYNOMIAL APPROXIMATION;

SPECIFICATION LANGUAGES;

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

References (17)

1. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20:97-123, no. 12 1994.
2. N. Beldiceanu, M. Carlsson, and T. Petit. Deriving filtering algorithms from constraint checkers. In Proc. of CP'2004.
3. N. Beldiceanu, I. Katriel, and S. Thiel. Filtering algorithms for the same and usedby constraints. MPI Technical Report MPI-I-2004-1-001, 2004.
4. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. SICS TR T2000/01.
5. N. Beldiceanu. Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proc. of CP'2001.
6. C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh. The complexity of global constraints. In Proc. of AAAI'2004.
7. B.M.W. Cheng, K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. Increasing Constraint Propagation by Redundant Modeling: an Experience Report. Constraints, 1998.
8. R. Debruyne and C. Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proc. of IJCAI'97.
9. M. Maher. Analysis of a global contiguity constraint. In Proc. of the CP'2002 Workshop on Rule Based Constraint Reasoning and Programming, 2002.
10. F. Pachet and P. Roy. Automatic generation of music programs. In Proc. of CP'99.
11. G. Pesant. A regular language membership constraint for finite sequences of variables. In Proc. of CP'2004.
12. C.-G. Quimper, A. Lopez-Ortiz, P. van Beek, and A. Golynski. Improved algorithms for the global cardinality constraint. In Proc. of CP'2004.
13. P. Refalo. Linear formulation of constraint programming models and hybrid solvers. In Proc. of CP'2000.
14. J-C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proc. of AAAI'94.
15. J-C. Régin. Generalized arc consistency for global cardinality constraints. In Proc. of AAAI'96.
16. J-C. Régin. The symmetric alldiff constraint. In Proc. of IJCAI'99. Morgan Kaufmann, 1999.
17. P. Van Hentenryck and J.-P. Carillon. Generality versus specificity: An experience with AI and OR techniques. In Proc. of AAAI'88.