On the Reification of Global Constraints

Nicolas Beldiceanu (1) , Mats Carlsson (2) , Pierre Flener (3) , Justin Pearson (3)

1 TASC - Theory, Algorithms and Systems for Constraints
2 SICS
3 DIT-UPPSALA - Department of Information Technology

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.

Domaines: Mathématique discrète [cs.DM]

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On the Reification of Global Constraints. Constraints, 2013, 18 (1), pp.1-6. ⟨10.1007/s10601-012-9132-0⟩. ⟨hal-00754252⟩