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
The Difference All-Difference Makes
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Symmetry Breaking using Value Precedence
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
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
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint 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
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The alldifferent constraint with precedences
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Translation-based constraint answer set solving
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
On the reification of global constraints
Constraints
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Complexity issues related to propagation completeness
Artificial Intelligence
| Hi-index | 0.00 |
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These decompositions can be easily added to new solvers. They also provide other constraints with access to the state of the propagator by sharing of variables. Such sharing can be used to improve propagation between constraints. We report experiments with our decomposition in a pseudo-Boolean solver.