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 …

Filtering algorithms for table constraints are constraint-based, which means that the
propagation queue only contains information on the constraints that must be reconsidered …

Abstract Historically, work on Constraint Satisfaction Problems (CSPs) began with binary
CSPs and algorithms proposed to enforce Arc Consistency (AC) on binary constraints. In …

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 …

Constraint Programming is devoted to finding solutions to hard combinatorial problems.
Such problems usually define exponentially large search spaces. Coping with such search …

Cet article 1 présente un nouvel algorithme de domaine consistance qui ne maintient pas
les supports dynamiquement lors de la propagation, mais plutôt maintient les valeurs …