Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)