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.

• Type: Conference
• Year: 2008
• Where: AIMSA
• Authors: Frédéric Lardeux, Eric Monfroy, Frédéric Saubion
• Keywords: AIMSA 2008, Artificial Intelligence, CSP Reduction Rules, Interleaved Alldiff Constraints