SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints - Université d'Angers
Communication Dans Un Congrès Année : 2009

SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints

Eric Monfroy
Broderick Crawford
  • Fonction : Auteur
Carlos Castro
  • Fonction : Auteur
  • PersonId : 755554
  • IdRef : 142760811

Résumé

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.

Fichier principal
Vignette du fichier
micai2009.pdf (255.54 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03350614 , version 1 (18-03-2022)

Identifiants

Citer

Frédéric Lardeux, Eric Monfroy, Frédéric Saubion, Broderick Crawford, Carlos Castro. SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints. 8th Mexican International Conference on Artificial Intelligence, MICAI 2009, 2009, Guanajuato, Mexico. pp.360-371, ⟨10.1007/978-3-642-05258-3_32⟩. ⟨hal-03350614⟩

Collections

UNIV-ANGERS LERIA
32 Consultations
61 Téléchargements

Altmetric

Partager

More