Sciweavers

AIMSA
2008
Springer

Interleaved Alldifferent Constraints: CSP vs. SAT Approaches

13 years 5 months ago
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding of these rules that preserves the reduction properties of CSP.
Frédéric Lardeux, Eric Monfroy, Fr&e
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where AIMSA
Authors Frédéric Lardeux, Eric Monfroy, Frédéric Saubion
Comments (0)