@inproceedings{02fb718c36544829b35a76b877809ac4,
title = "SAT encoding and CSP reduction for interconnected alldiff constraints",
abstract = "Constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT) are two well known paradigm to model and solve combinatorial problems. Modeling and resolution of CSP is often strengthened by global constraints (e.g., Alldiff constraint). This paper highlights two different ways of handling specific structural information: a uniform propagation framework to handle (interleaved) Alldiff constraints with some CSP reduction rules; and a SAT encoding of these rules that preserves the reduction properties of CSP.",
author = "Frederic Lardeux and Eric Monfroy and Frederic Saubion and Broderick Crawford and Carlos Castro",
year = "2009",
doi = "10.1007/978-3-642-05258-3_32",
language = "English",
isbn = "3642052576",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "360--371",
booktitle = "MICAI 2009",
note = "8th Mexican International Conference on Artificial Intelligence, MICAI 2009 ; Conference date: 09-11-2009 Through 13-11-2009",
}