Abstract
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. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
APA
Lardeux, F., Monfroy, E., & Saubion, F. (2008). Interleaved alldifferent constraints: CSP vs. SAT approaches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5253 LNAI, pp. 380–384). https://doi.org/10.1007/978-3-540-85776-1_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free