Abstract
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogoods has an empty left-hand side, the considered value is eliminated unconditionally, once and for all. This value deletion can be propagated using standard arc consistency techniques, producing new deletions in the domains of other variables. This causes substantial reductions in the search effort required to solve a class of problems. We also extend this idea to the propagation of conditional deletions, something already proposed in the past. We provide experimental results that show the benefits of the proposed approach, especially considering communication cost.
Supported by the Spanish project TIN2006-15387-C03-01.
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
Baker, A.B.: The hazards of fancy backtracking. In: Proc. of AAAI 1994, pp. 288–293 (1994)
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: The Asynchronous Backtracking without adding links: a new member in the ABT family. Artifical Intelligence 161, 7–24 (2005)
Bessiere, C., Regin, J.C.: Refining the basic constraint propagation algorithm. In: Proc. IJCAI 2001, pp. 309–315 (2001)
Brito, I., Meseguer, P.: Improving ABT performance by adding synchronization points. In: Recent Advances in Constraints (in press, 2008)
Dechter, R., Pearl, J.: Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence 34, 1–38 (1988)
Debruyne, R., Bessiere, C.: Domain filtering consistencies. JAIR 14, 205–230 (2001)
Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing Performance of Distributed Constraint Processing Algorithms. In: AAMAS Workshop on Distributed Constr. Reas., pp. 86–93 (2002)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous Search with Aggregations. In: Proc. of AAAI 2000, pp. 917–922 (2000)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Consistency Maintenance for ABT. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 271–285. Springer, Heidelberg (2001)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous consistency and maintenance in distributed constraint satisfaction. Artificial Intelligence 161, 25–53 (2005)
Smith, B.: Phase Transition and the Mushy Region in Constraint Satisfaction Problems. In: Proc. of the 11th ECAI, pp. 100–104 (1994)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In: Proc. of the 12th. DCS, pp. 614–621 (1992)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Know. and Data Engin. 10, 673–685 (1998)
Zivan, R., Meisels, A.: Dynamic ordering for asynchronous backtracking on DisCSPs. Constraints 11, 179–197 (2006)
Zivan, R., Zazone, M., Meisels, A.: Min-domain ordering for asynchronous backtracking. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 758–772. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brito, I., Meseguer, P. (2008). Connecting ABT with Arc Consistency. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)