{"type":"ScholarlyArticle","title":"From Support Propagation to Belief Propagation in Constraint Programming (Extended Abstract)","authors":[{"name":"Gilles Pesant","slug":"gilles-pesant","given":"Gilles","family":"Pesant","affiliation":"Polytechnique Montréal , Montreal , Canada"}],"abstract":"The distinctive driving force of constraint programming (CP) to solve combinatorial problems has been a privileged access to problem structure through the high-level models it uses. We investigate a richer propagation medium for CP made possible by recent work on counting solutions inside constraints. Beliefs about individual variable-value assignments are exchanged between contraints and iteratively adjusted. Its advantage over standard belief propagation is that  the higher-level models do not tend to create as many cycles, which are known to be problematic for convergence.  We find that it significantly improves search guidance.","doi":"10.24963/ijcai.2020/715","url":"https://ijcai.org/proceedings/2020/715","pdf":"https://ijcai.org/proceedings/2020/0715.pdf","markdown":"https://ijcai.org/proceedings/2020/715.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/715","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Journal track","track":"Journal track","number":715,"pages":{"first":5100,"last":5104},"keywords":["Constraints and SAT: Constraints and Data Mining ; Constraints and Machine Learning","Constraints and SAT: Constraints: Modeling, Solvers, Applications","Heuristic Search and Game Playing: Combinatorial Search and Optimisation"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25474/file_25474.m3u8","length_sec":299,"provider":"hls"}],"references":[{"position":1,"raw":"[Brockbank et al., 2013] Simon Brockbank, Gilles Pesant, and L.-M. Rousseau. Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems. In Chris- tian Schulte, editor, Principles and Practice of Constraint Programming -19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, volume 8124 of Lecture Notes in Computer Science, pages 175-183. Springer, 2013.","title":"Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems","authors":"Simon Brockbank, Gilles Pesant, L.-M Rousseau","year":"2013","venue":"Principles and Practice of Constraint Programming -19th International Conference, CP 2013","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Chavira and Darwiche, 2008] Mark Chavira and Adnan Darwiche. On Probabilistic Inference by Weighted Model Counting. Artif. Intell., 172(6-7):772-799, 2008.","title":"On Probabilistic Inference by Weighted Model Counting","authors":"Darwiche Chavira, Mark Chavira, Adnan Darwiche","year":"2008","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dechter et al., 2010] R. Dechter, B. Bidyuk, R. Mateescu, and E. Rollon. On the Power of Belief Propagation: A Constraint Propagation Perspective. In Festschrift book in honor of Judea Pearl. 2010.","title":"On the Power of Belief Propagation: A Constraint Propagation Perspective","authors":"R Dechter, B Bidyuk, R Mateescu, E Rollon","year":"2010","venue":"Festschrift book in honor of Judea Pearl","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Demeulenaere et al., 2016] Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Compact- Table: Efficiently Filtering Table Constraints with Re- versible Sparse Bit-Sets. In Michel Rueher, editor, Princi- ples and Practice of Constraint Programming -22nd Inter- national Conference, CP 2016, Toulouse, France, Septem- ber 5-9, 2016, Proceedings, volume 9892 of Lecture Notes in Computer Science, pages 207-223. Springer, 2016.","title":"Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets","authors":"Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus","year":"2016","venue":"Principles and Practice of Constraint Programming -22nd International Conference","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Horsch and Havens, 2013] Michael C. Horsch and William S. Havens. Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Proba- bilistic Reasoning. CoRR, abs/1301.3864, 2013.","title":"Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning","authors":"C Michael, William S Horsch, Havens","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Jerrum et al., 2001] Mark Jerrum, Alistair Sinclair, and Eric Vigoda. A Polynomial-time Approximation Algorithm for the Permanent of a Matrix with Non-negative Entries. In Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, STOC '01, pages 712-721, New York, NY, USA, 2001. ACM.","title":"A Polynomial-time Approximation Algorithm for the Permanent of a Matrix with Non-negative Entries","authors":"Mark Jerrum, Alistair Sinclair, Eric Vigoda","year":"2001","venue":"Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, STOC '01","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Michel et al., 2017] Laurent Michel, Pierre Schaus, and Pascal Van Hentenryck. Mini-CP: A Minimalist Open- Source Solver to Teach Constraint Programming. http: //www.minicp.org, 2017.","title":"Mini-CP: A Minimalist Open-Source Solver to Teach Constraint Programming","authors":"Laurent Michel, Pierre Schaus, Pascal Van Hentenryck","year":null,"venue":null,"doi":null,"url":"http://www.minicp.org,2017","internal_url":null},{"position":8,"raw":"[Pearl, 1982] Judea Pearl. Reverend Bayes on Inference En- gines: A Distributed Hierarchical Approach. In David L. Waltz, editor, Proceedings of the National Conference on Artificial Intelligence. Pittsburgh, PA, August 18-20, 1982., pages 133-136. AAAI Press, 1982.","title":"Judea Pearl. Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach","authors":"Pearl","year":"1982","venue":"Proceedings of the National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Pesant and Quimper, 2008] Gilles Pesant and C.-G. Quim- per. Counting Solutions of Knapsack Constraints. In Lau- rent Perron and Michael A. Trick, editors, Integration of AI and OR Techniques in Constraint Programming for Com- binatorial Optimization Problems, 5th International Con- ference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings, volume 5015 of Lecture Notes in Computer Science, pages 203-217. Springer, 2008.","title":"Counting Solutions of Knapsack Constraints","authors":"Gilles Pesant, C.-G","year":"2008","venue":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pesant et al., 2012] Gilles Pesant, C.-G. Quimper, and Alessandro Zanarini. Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. J. Artif. Intell. Res., 43:173-210, 2012.","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","authors":"C.-G Gilles Pesant, Alessandro Quimper, Zanarini","year":"2012","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Pesant, 2015] Gilles Pesant. Achieving Domain Consis- tency and Counting Solutions for Dispersion Constraints. INFORMS Journal on Computing, 27(4):690-703, 2015.","title":"Achieving Domain Consistency and Counting Solutions for Dispersion Constraints","authors":"Gilles Pesant, Pesant","year":"2015","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Pesant, 2017] Gilles Pesant. Getting More Out of the Ex- posed Structure in Constraint Programming Models of Combinatorial Problems. In Satinder P. Singh and Shaul Markovitch, editors, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 4846-4851. AAAI Press, 2017.","title":"Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems","authors":"Gilles Pesant, Pesant","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Pesant, 2019] Gilles Pesant. From Support Propagation to Belief Propagation in Constraint Programming. J. Artif. Intell. Res., 66:123-150, 2019.","title":"From Support Propagation to Belief Propagation in Constraint Programming","authors":"Gilles Pesant, Pesant","year":"2019","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Soules, 2003] G.W. Soules. New Permanental Upper Bounds for Nonnegative Matrices. Linear and Multilin- ear Algebra, 51(4):319-337, 2003.","title":"New Permanental Upper Bounds for Nonnegative Matrices","authors":"G W Soules","year":"2003","venue":"Linear and Multilinear Algebra","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Valiant, 1979] L. Valiant. The Complexity of Computing the Permanent. Theoretical Computer Science, 8(2):189- 201, 1979.","title":"The Complexity of Computing the Permanent","authors":"L Valiant","year":"1979","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Werner, 2015] Tomás Werner. Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings. IEEE Trans. Pattern Anal. Mach. Intell., 37(7):1455-1468, 2015.","title":"Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings","authors":"Tomás Werner","year":"2015","venue":"IEEE Trans. Pattern Anal. Mach. Intell","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}