Global Constraints in Distributed Constraint Satisfaction and Optimization

Abstract : Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global constraints with local consistency (both in the hard and soft cases), in particular for generalized arc consistency (GAC). We provide experimental evidence of the benefits of global constraints on several benchmarks, both for distributed constraint satisfaction and for distributed constraint optimization.
Type de document :
Article dans une revue
The Computer Journal, Oxford University Press (UK), 2014, 57 (6), pp.906-923. 〈10.1093/comjnl/bxt088〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01067483
Contributeur : Joël Quinqueton <>
Soumis le : mardi 23 septembre 2014 - 14:56:13
Dernière modification le : jeudi 24 mai 2018 - 15:59:23

Lien texte intégral

Identifiants

Collections

Citation

Christian Bessière, Ismel Brito, Patricia Gutierrez, Pedro Meseguer. Global Constraints in Distributed Constraint Satisfaction and Optimization. The Computer Journal, Oxford University Press (UK), 2014, 57 (6), pp.906-923. 〈10.1093/comjnl/bxt088〉. 〈lirmm-01067483〉

Partager

Métriques

Consultations de la notice

113