Abstract
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, we present the Distributed Forward Checking algorithm, a natural successor of Asynchronous Backtracking, where some privacy is achieved on agent values. Regarding constraints, we introduce the Partially Known Constraints model, which allow a constraint between two agents to be not completely known by any of them. With these elements, we obtain new solving algorithms that enforce privacy and maintain completeness. Empirical results are provided.
This research is supported by the REPLI project TIC-2002-04470-C03-03.
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
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: The Asynchronous Backtracking Family (2003) (submitted for publication)
Bessiere, C., Maestre, A., Meseguer, P.: Distributed Dynamic Backtracking. In: Distributed Constraint Reasoning Workshop, IJCAI 2001, Seattle, USA (2001)
Haralick, R., Elliot, G.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Knowledge and Data Engineering 10, 673–685 (1998)
Yokoo, M., Suzuki, K., Hirayama, K.: Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 387. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brito, I., Meseguer, P. (2003). Distributed Forward Checking. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive