AbstractH. Xu, S. Kumar and S. Koenig. Min-Max Message Passing and Local Consistency in Constraint Networks. In Australasian Joint Conference on Artificial Intelligence (AI), pages 340-352, 2017.
Abstract: 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.
Download the paper in pdf.
Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.
This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.