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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01067483
Contributor : Joël Quinqueton <>
Submitted on : Tuesday, September 23, 2014 - 2:56:13 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM

Links full text

Identifiers

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〉

Share

Metrics

Record views

123