“…From an early time, global constraints have been used for their strong pruning power thanks to efficient specialised filtering algorithms that take advantage of the structure of the constraints they consider (see for instance, the filtering algorithms proposed for the alldifferent constraint [24,29,52,53,56,63,68]). More recently, it became clear that global constraints are not only useful for their deductive power, but that they also have a central role to play in modelling languages for problem solving [77], in local search [78], in symmetry breaking [65], in visualisation tools for debugging constraint programs [74], in linear programming tools [46] or in deriving efficient heuristics [41] based on their internal status.…”