Filtering Decomposable Global Cost Functions - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2012

Filtering Decomposable Global Cost Functions


As Lee and Leung have previously shown this year, weighted constraint satisfaction problems can benefit from the introduction of global cost functions, leading to a new Cost Function Programming paradigm. In this paper, we explore the possibility of decomposing global cost functions in such a way that enforcing soft local consistencies on the decomposition achieves the same level of consistency on the original global cost function. We give conditions under which directional and virtual arc consistency offer such guarantees. We conclude by experiments on decomposable cost functions showing that decompositions may be very useful to easily integrate efficient global cost functions in solvers.
Fichier principal
Vignette du fichier
aaai12.pdf (139.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00748187 , version 1 (09-11-2012)


  • HAL Id : lirmm-00748187 , version 1


David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, et al.. Filtering Decomposable Global Cost Functions. AAAI Conference on Artificial Intelligence, Jul 2012, Toronto, ON, Canada. ⟨lirmm-00748187⟩
321 View
231 Download


Gmail Mastodon Facebook X LinkedIn More