On the reification of global constraints

Authors:
Nicolas Beldiceanu;Mats Carlsson;Pierre Flener;Justin Pearson
Affiliations:
TASC team (CNRS/INRIA), Nantes, France 44307;SICS, Kista, Sweden 164 29;Uppsala University, Uppsala, Sweden 751 05;Uppsala University, Uppsala, Sweden 751 05
Venue:
Constraints
Year:
2013

Citing 6
Cited 0

The Design of the Zinc Modelling Language

Constraints
MINION: A Fast, Scalable, Constraint Solver

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Implementing logical connectives in constraint programming

Artificial Intelligence
A constraint seeker: finding and ranking global constraints from examples

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Half reification and flattening

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a simple idea for deriving reified global constraints in a systematic way. It is based on the observation that most global constraints can be reformulated as a conjunction of total function constraints together with a constraint that can be easily reified.