Skip to Main content Skip to Navigation
Journal articles

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
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Joël Quinqueton Connect in order to contact the contributor
Submitted on : Thursday, October 10, 2019 - 1:57:11 PM
Last modification on : Friday, October 22, 2021 - 3:07:33 PM


Files produced by the author(s)




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⟩



Record views


Files downloads