Compact-table: efficiently filtering table constraints with reversible sparse bit-sets
J Demeulenaere, R Hartert, C Lecoutre… - Principles and Practice …, 2016 - Springer
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 …
Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator …
STR2: optimized simple tabular reduction for table constraints
C Lecoutre - Constraints, 2011 - Springer
Table constraints play an important role within constraint programming. Recently, many
schemes or algorithms have been proposed to propagate table constraints and/or to …
schemes or algorithms have been proposed to propagate table constraints and/or to …
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
KCK Cheng, RHC Yap - Constraints, 2010 - Springer
A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc
(or extensional) representation may require space exponential to the arity of the constraint …
(or extensional) representation may require space exponential to the arity of the constraint …
Improving GAC-4 for table and MDD constraints
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 …
arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 …
XCSP3: an integrated format for benchmarking combinatorial constrained problems
F Boussemart, C Lecoutre, G Audemard… - arXiv preprint arXiv …, 2016 - arxiv.org
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 …
representations of combinatorial constrained problems. This new format is able to deal with …
Generalised arc consistency for the alldifferent constraint: An empirical survey
The AllDifferent constraint is a crucial component of any constraint toolkit, language or
solver, since it is very widely used in a variety of constraint models. The literature contains …
solver, since it is very widely used in a variety of constraint models. The literature contains …
A compression algorithm for large arity extensional constraints
G Katsirelos, T Walsh - International conference on principles and practice …, 2007 - Springer
We present an algorithm for compressing table constraints representing allowed or
disallowed tuples. This type of constraint is used for example in configuration problems …
disallowed tuples. This type of constraint is used for example in configuration problems …
Xcsp3-core: A format for representing constraint satisfaction/optimization problems
F Boussemart, C Lecoutre, G Audemard… - arXiv preprint arXiv …, 2020 - arxiv.org
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 satisfaction/optimization problems. The interest of XCSP3-core is multiple:(i) …
The smart table constraint
Table Constraints are very useful for modeling combinatorial problems in Constraint
Programming (CP). They are a universal mechanism for representing constraints, but …
Programming (CP). They are a universal mechanism for representing constraints, but …
Generalized arc consistency algorithms for table constraints: A summary of algorithmic ideas
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 …
While there are many kinds of constraints, the table constraint (also called a CSP) is perhaps …