Hong Xu, T. K. Satish Kumar, and Sven Koenig.
Min-max message passing and local consistency in constraint networks.
In Proceedings of the 30th Australasian Joint Conference on Artificial Intelligence (AI), 340–352. 2017.
[full text] [slides] [BibTeX▼]
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.