论文信息 - Distributed Forward Checking

Distributed Forward Checking

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.

Pedro Meseguer | Ismel Brito | P. Meseguer | Ismel Brito

[1] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[2] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[3] Christian Bessiere,et al. Distributed Dynamic Backtracking , 2001, CP.

[4] Nicolas Barnier,et al. Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[5] Christian Bessiere,et al. The Asynchronous Backtracking Family , 2003 .

[6] Makoto Yokoo,et al. Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..