Interleaved Alldifferent Constraints: CSP vs. SAT Approaches

Authors:
Frédéric Lardeux;Eric Monfroy;Frédéric Saubion
Affiliations:
LERIA, Université d'Angers, France;Universidad Técnica Federico Santa María, Valparaíso, Chile and LINA, Université de Nantes, France;LERIA, Université d'Angers, France
Venue:
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Year:
2008

Citing 4
Cited 0

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Principles of Constraint Programming

Principles of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

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.