Global Constraints in Distributed CSP: Concurrent GAC and Explanations in ABT
Refereed Conference Meeting Proceeding
The expressiveness of Distributed CSP has been recently enhanced to include global constraints. Careful reformulation of contractible global constraints has been shown to improve efficiency. In this paper, we first show that explained global constraints further improves the efficiency in distributed problems, sometimes by over two orders of magnitude. We then propose maintaining GAC concurrently for any global constraint, without reformulation. We show empirically that concurrent GAC significantly reduces both message passing and computation time, achieving an order of magnitude improvement on some distributed meeting scheduling problems.
The 20th International Conference on Principles and Practice of Constraint Programming (CP'2014)
Digital Object Identifer (DOI):
National University of Ireland, Cork (UCC)
Open access repository: