Abstract
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such a combination in asynchronous settings1. The difficulty in this case is that, in the usual algorithms, the instantiation and consistency enforcement steps must alternate sequentially. When brought to a distributed setting, a similar approach forces the search algorithm to be synchronous in order to benefit from consistency maintenance. Asynchronism [24],[14] is highly desirable since it increases flexibility and parallelism, and makes the solving process robust against timing variations. One of the most well-known asynchronous search algorithms is Asynchronous Backtracking (ABT). This paper shows how an algorithm for maintaining consistency during distributed asynchronous search can be designed upon ABT. The proposed algorithm is complete and has polynomial-space complexity. Since the consistency propagation is optional, this algorithms generalizes forward checking as well as chronological backtracking. An additional advance over existing centralized algorithms is that it can exploit available backtracking-no goods for increasing the strength of the maintained consistency. The experimental evaluation shows that it can bring substantial gains in computational power compared with existing asynchronous algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.-F. Baget and Y.S. Tognetti. Backtracking through biconnected components of a constraint graph. In Proc. of IJCAI-01, pages 291–296, 2001.
B. Baudot and Y. Deville. Analysis of distributed arc-consistency algorithms. Technical Report RR-97-07, U. Catholique Louvain, 97.
C. Bessière, A. Maestre, and P. Meseguer. Distributed dynamic backtracking. In Proc. IJCAI DCR Workshop, pages 9–16, 2001.
Z. Collin, R. Dechter, and S. Katz. Self-stabilizing distributed constraint satisfaction. Chicago Journal of Theoretical Computer Science, 2000.
J. Denzinger. Tutorial on distributed knowledge based search. IJCAI-01, August 2001.
E.C. Freuder, M. Minca, and R.J. Wallace. Privacy/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents. In Proc. IJCAI DCR Workshop, pages 63–72, 2001.
M. Hannebauer. On proving properties of concurrent algorithms for distributed csps. In Proc. of CP-01 DisCS Workshop. EPFL, 2000.
W. Havens. Nogood caching for multiagent backtrack search. In Proc. AAAI’97 Constraints and Agents Workshop, 1997.
S. Kasif. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence, 45(3):275–286, October 1990.
P. Meseguer and M. A. Jiménez. Distributed forward checking. In Proceedings of the International Workshop on Distributed Constraint Satisfaction. CP'00, 2000.
D. Sabin and E. C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings ECAI-94, pages 125–129,1994.
M.-C. Silaghi, Ş. Sabău, D. Sam-Haroud, and B.V. Faltings. Asynchronous search for numeric DisCSPs. In Proc. of CP’2001, Paphos,Cyprus, 2001.
M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. ABT with Asynch. Reordering. In IAT, 2001.
M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Asynchronous search with aggregations. In Proc. of AAAI2000, pages 917–922, 2000.
M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Maintaining hierarchical distributed consistency. In Proc. of CP-00 Workshop on DisCS, 2000.
M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Multiply asynchronous search with abstractions. In IJCAI-01 DCR Workshop, pages 17–32, Seattle, August 2001.
M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Search techniques for non-liniar constraint satisfaction problems with inequalities. In Proc. of AI2001, Otawa, June 2001.
M.-C. Silaghi, D. Sam-Haroud, and B.V. Faltings. Hybridyzing ABT and AWC into a polynomial space, complete protocol with reordering. Technical Report #364, EPFL, May 2001.
M.C. Silaghi and B. Faltings. Parallel proposals in asynchronous search. Technical Report #371, EPFL, August 2001.
G. Solotorevsky, E. Gudes, and A. Meisels. Distributed Constraint Satisfaction Problems-a model and application. Preprint: http://www.cs.bgu.ac.il/~am, 1997.
G. Tel. Multiagent Systems,A Modern Approach to Distributed AI, chapter Distributed Control Algorithms for AI, pages 539–580. MIT Press, 1999.
E. H. Turner and J. Phelps. Determining the usefulness of information from its use during problem solving. In Proceedings of AA2000, pages 207–208, 2000.
M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In ICDCS’92, pages 614–621, June 1992.
M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The Distributed CSP: Formalization and algorithms. IEEE Trans. on KDE, 10(5):673–685, 1998.
Y. Zhang and A. K. Mackworth. Parallel and distributed algorithms for finite constraint satisfaction problems. In Proc. of Third IEEE Symposium on Parallel and Distributed Processing, pages 394–397, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silaghi, MC., Sam-Haroud, D., Faltings, B. (2001). Consistency Maintenance for ABT. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive