Global Constraints in Distributed Constraint Satisfaction
Abstract
Global constraints have been crucial for the success of centralized constraint programming. Here, we propose the inclusion of global constraints in distributed constraint satisfaction. We show how this inclusion can be done, considering different decompositions for global contraints. We provide experimental evidence of their bene- fits on several benchmarks solved with the ABT algorithm.
Origin : Files produced by the author(s)
Loading...