Global constraints in distributed CSP: Concurrent GAC and explanations in ABT

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings
PublisherSpringer Verlag
Pages721-737
Number of pages17
ISBN (Print)9783319104270
DOIs
Publication statusPublished - 2014
Event20th International Conference on the Principles and Practice of Constraint Programming, CP 2014 - Lyon, France
Duration: 8 Sep 201412 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8656 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on the Principles and Practice of Constraint Programming, CP 2014
Country/TerritoryFrance
CityLyon
Period8/09/1412/09/14

Fingerprint

Dive into the research topics of 'Global constraints in distributed CSP: Concurrent GAC and explanations in ABT'. Together they form a unique fingerprint.

Cite this