Min-Max Message Passing and Local Consistency in Constraint Networks
In this paper, we uncover some relationships between local consistency in constraint networks and message passing akin to belief propagation in probabilistic reasoning. We develop a new message passing algorithm, called the min-max message passing (MMMP) algorithm, for unifying the different notions of local consistency in constraint networks. In particular, we study its connection to arc consistency (AC) and path consistency. We show that AC-3 can be expressed more intuitively in the framework of message passing. We also show that the MMMP algorithm can be modified to enforce path consistency.
KeywordsMessage passing Constraint network Local consistency
- 9.Yedidia, J.S., Freeman, W.T., Weiss, Y.: Bethe free energy, Kikuchi approximations, and belief propagation algorithms. Technical report R2001-16, Mitsubishi Electric Research Laboratories (2001)Google Scholar
- 10.Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. Explor. Artif. Intell. New Millenn. 8, 239–269 (2003)Google Scholar