Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Filtering decomposable global cost functions

Abstract : As [19, 18] have shown, weighted constraint satisfaction problems can bene t 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 o ers guarantees on the level of consistency enforced on the original global cost function. We show that directional arc consistency and virtual arc consistency o er such guarantees.We conclude by experimention decomposable cost functions showing that decompo- sitions may be very useful to easily integrate e cient global cost functions in solvers.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.inrae.fr/hal-02747813
Déposant : Migration Prodinra <>
Soumis le : mercredi 3 juin 2020 - 12:23:54
Dernière modification le : mercredi 18 novembre 2020 - 18:09:14

Identifiants

  • HAL Id : hal-02747813, version 1
  • PRODINRA : 259129

Citation

David Allouche, Christian Bessière, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, et al.. Filtering decomposable global cost functions. Twenty-Sixth Conference on Artificial Intelligence, Jul 2012, Toronto, Canada. pp.7. ⟨hal-02747813⟩

Partager

Métriques

Consultations de la notice

10