Abstract The Compact-Table (CT) algorithm is the current state-of-the-art algorithm for
enforcing Generalized Arc Consistency (GAC) on table constraints during search. Recently …

De nombreuses applications informatiques nécessitent de résoudre des problèmes de
décision qui sont difficiles d'un point de vue mathématique. La programmation par …

Filtering constraint networks to reduce search space is one of the main cornerstones of
Constraint Programming and among them (Generalized) Arc Consistency has been the most …

Generalized arc consistency (GAC) is one of the most fundamental properties for reducing
the search space when solving constraint satisfaction problems (CSPs). Consistencies …

Consistency algorithms, which perform inference, are at the heart of Constraint
Programming. The strongest consistency level provided in most constraint solvers is …

Constraint Processing is an expressive and powerful framework for modeling and solving
combinatorial decision problems. Enforcing consistency during backtrack search is an …

Applying parallelism to constraint solving seems a promising approach and it has been
done with varying degrees of success. Early attempts to parallelize constraint propagation …

Constraint Programming (CP) is a successful and useful approach to solve large
combinatorial problems such as timetabling, scheduling, and resource allocation. These …