Generic filtering algorithms for generic global constraints

In a first phase, this talk presents an extension of the framework for classifying global constraints that was introduced in 2000. This is concretely illustrated by showing how constraints like alldifferent, cumulative, cutset, cycle, diffn, element, global cardinality, lexicographic ordering, soft alldifferent, or stretch fit into this framework. In a second phase, this talk motivates the need for generic filtering algorithms from different viewpoints. Finally it gives some preliminary hints of how such generic algorithms could be developed