In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized
Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator …

Abstract We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining
arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 …

Table Constraints are very useful for modeling combinatorial problems in Constraint
Programming (CP). They are a universal mechanism for representing constraints, but …

Constraint Programming is a powerful paradigm to model and solve combinatorial problems.
While there are many kinds of constraints, the table constraint (also called a CSP) is perhaps …

Table constraints are very useful for modeling combinatorial constrained problems, and thus
play an important role in Constraint Programming (CP). During the last decade, many …

Constraint propagation is a key to the success of Constraint Programming (CP). The
principle is that filtering algorithms associated with constraints are executed in sequence …

Table constraints are instrumental in modelling combinatorial problems with Constraint
Programming. Recently, Compact-Table (CT) has been proposed and shown to be as an …

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization
problems. The special case of TSP in bounded-dimensional Euclidean spaces has been a …

An important criteria to assert the security of a cryptographic primitive is its resistance
against differential cryptanalysis. For word-oriented primitives, a common technique to …

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 …