Global constraints as graph properties on a structured network of elementary constraints of the same type

Abstract

This paper introduces a classification scheme for global constraints. This classification is based on a small number of basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in terms of graph properties that have to hold, where the graph is a structured network of same elementary constraints.