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 …

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …

In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent
constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple:(i) …

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 …

One of the most widely studied classes of constraints in constraint programming (CP) is that
of table constraints. Numerousspecialized filtering algorithms, enforcing the wellknown …

Many industrial applications require the use of table constraints (eg, in configuration
problems), sometimes of significant size. During the recent years, researchers have focused …

Filtering algorithms for table constraints can be classified in two categories: constraint-based
and value-based. In the constraint-based approaches, the propagation queue only contains …

Multivalued Decision Diagrams (MDDs) are efficient data structures widely used in several
fields like verification, optimization and dynamic programming. In this thesis, we first focus on …

The smart table constraint represents a powerful modeling tool that has been recently
introduced. This constraint allows the user to represent compactly a number of well-known …

Abstract Simple Tabular Reduction (STR) is a state-of-the-art filtering technique for enforcing
Generalized Arc Consistency (GAC) on positive table constraints. Despite its good …