Propagating Conjuctions of ALLDIFFERENT Constraints - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Propagating Conjuctions of ALLDIFFERENT Constraints


We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value bipartite graph. Therefore, we investigate the problem of finding simultaneous bipartite match-ings. We present an extension of the famous Hall theorem which characterizes when simultaneous bipartite matchings exists. Unfortunately, finding such matchings is NP-hard in general. However, we prove a surprising result that finding a simultaneous matching on a convex bipartite graph takes just polynomial time. Based on this theoretical result, we provide the first polynomial time bound consistency algorithm for the conjunction of two ALLDIFFERENT constraints. We identify a pathological problem on which this propagator is exponentially faster compared to existing propagators. Our experiments show that this new propagator can offer significant benefits over existing methods.
Fichier principal
Vignette du fichier
aaai10-overlap.pdf (166.42 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

lirmm-00558126 , version 1 (11-10-2019)


  • HAL Id : lirmm-00558126 , version 1


Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh. Propagating Conjuctions of ALLDIFFERENT Constraints. AAAI Conference on Artificial Intelligence, Jul 2010, Atlanta, GA, United States. pp.27-32. ⟨lirmm-00558126⟩
214 View
27 Download


Gmail Facebook X LinkedIn More