Decomposition of the NVALUE constraint

Authors:
Christian Bessiere;George Katsirelos;Nina Narodytska;Claude-Guy Quimper;Toby Walsh
Affiliations:
LIRMM, CNRS, Montpellier;CRIL, CNRS, Lens;NICTA and University of NSW, Sydney, Australia;Université Laval;NICTA and University of NSW, Sydney, Australia
Venue:
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Year:
2010

Citing 19
Cited 1

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Automatic Generation of Music Programs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Reformulation of Global Constraints Based on Constraints Checkers

Constraints
Filtering Algorithms for the NValue Constraint

Constraints
The Complexity of Reasoning with Global Constraints

Constraints
The complexity of global constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The parameterized complexity of global constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The difference all-difference makes

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The range and roots constraints: specifying counting and occurrence problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Circuit complexity and decompositions of global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Encodings of the SEQUENCE constraint

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Propagation = lazy clause generation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Revisiting the sequence constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Global grammar constraints

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

Exploiting constraints

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposition can simulate with the same time complexity but with a much greater space complexity. This suggests that the benefit of a global propagator may often not be in saving time but in saving space. Our other theoretical contribution is to show for the first time that range consistency can be enforced on NVALUE with the same worst-case time complexity as bound consistency. Finally, the decompositions we study are readily encoded as linear inequalities. We are therefore able to use them in integer linear programs.