On the Reification of Global Constraints

Nicolas Beldiceanu 1, * Mats Carlsson 2 Pierre Flener 3 Justin Pearson 3
* Corresponding author
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
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 pure functional dependency constraints together with a constraint that can be easily reified. We first show how the core constraints of the Global Constraint Catalogue can be reified and we then identify several reification categories that apply to at least 82% of the constraints in the Global Constraint Catalogue.
Document type :
Complete list of metadatas

Contributor : Contraintes Lina <>
Submitted on : Tuesday, November 20, 2012 - 7:47:55 AM
Last modification on : Friday, June 22, 2018 - 9:29:35 AM


  • HAL Id : hal-00754039, version 1


Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On the Reification of Global Constraints. 2012. ⟨hal-00754039⟩



Record views