Global Constraint Catalogue: Past, Present and Future Page 1 Constraints (2007) 12:21–62 DOI
10.1007/s10601-006-9010-8 Global Constraint Catalogue: Past, Present and Future Nicolas …

We show that tools from circuit complexity can be used to study decompositions of global
constraints. In particular, we study decompositions of global constraints into conjunctive …

Constraint programming (CP) is mainly based on filtering algorithms; their association with
global constraints is one of the main strengths of CP because they exploit the specific …

In this paper we describe a Constraint Seeker application which provides a web interface to
search for global constraints in the global constraint catalog, given positive and negative …

Markov processes are increasingly used to generate finite-length sequences that imitate a
given style. However, Markov processes are notoriously difficult to control. Recently, Markov …

We study the CARDPATH constraint. This ensures a given constraint holds a number of
times down a sequence of variables. We show that SLIDE, a special case of CARDPATH …

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 …

We describe a large family of constraints for structural time series by means of function
composition. These constraints are on aggregations of features of patterns that occur in a …

This paper introduces a global constraint encapsulating a regular constraint together with
several cumulative costs. It is motivated in the context of personnel scheduling problems …

First this report presents a restricted set of finite transducers used to synthesise structural
time-series constraints described by means of a multi-layered function composition scheme …