Abstract
Message propagation algorithms are very effective at finding satisfying assignments for SAT instances, and hard regions of a random SAT have become narrower. However, message propagation algorithms do not always converge for some random SAT instances. Unfortunately, a rigorous theoretical proof of this phenomenon is still lacking. The survey propagation (SP) algorithm is very effective at solving SAT instances, and a theoretical analysis of SP is very important in designing other message passing algorithms. Through this study, we derived the sufficient conditions for convergence of SP with extending message [0,~1] to message $(-\infty,\infty)$. Finally, the experiment results show that the conditions for the convergence of SP are very effective in random 3-SAT instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
