Introduction to algorithms
Domination in convex and chordal bipartite graphs
Information Processing Letters
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic Generation of Music Programs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A New Multi-resource cumulatives Constraint with Negative Heights
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Soft Constraint of Equality: Complexity and Approximability
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The range and roots constraints: specifying counting and occurrence problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A constraint on the number of distinct vectors with application to localization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraints of difference and equality: a complete taxonomic characterisation
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Soft constraints of difference and equality
Journal of Artificial Intelligence Research
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Filtering algorithms for the NVALUE constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Among, common and disjoint constraints
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
The range constraint: algorithms and implementation
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Kernels for global constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint "at most n distinct values for a set of variables". This can be considered as the counterpart of Regin's algorithm for the alldifferent constraint where one enforces having at least n distinct values for a given set of n variables.