Global Constraints in Distributed Constraint Satisfaction and Optimization - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles The Computer Journal Year : 2014

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.

Keywords

Fichier principal
Vignette du fichier
computerJ14.pdf (3.03 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01067483 , version 1 (10-10-2019)

Identifiers

Cite

Christian Bessiere, Ismel Brito, Patricia Gutierrez, Pedro Meseguer. Global Constraints in Distributed Constraint Satisfaction and Optimization. The Computer Journal, 2014, 57 (6), pp.906-923. ⟨10.1093/comjnl/bxt088⟩. ⟨lirmm-01067483⟩
145 View
85 Download

Altmetric

Share

Gmail Facebook X LinkedIn More