{"type":"ScholarlyArticle","title":"Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets","authors":[{"name":"Hélène Verhaeghe","slug":"helene-verhaeghe","given":"Hélène","family":"Verhaeghe","affiliation":"ICTEAM , UCLouvain , Place Sainte Barbe 2 , 1348 Louvain-la-Neuve , Belgium"},{"name":"Christophe Lecoutre","slug":"christophe-lecoutre","given":"Christophe","family":"Lecoutre","affiliation":"CRIL-CNRS UMR 8188 , Université d'Artois , F-62307 Lens , France"},{"name":"Pierre Schaus","slug":"pierre-schaus","given":"Pierre","family":"Schaus","affiliation":"ICTEAM , UCLouvain , Place Sainte Barbe 2 , 1348 Louvain-la-Neuve , Belgium"}],"abstract":"Multi-Valued Decision Diagrams (MDDs) are instrumental in modeling combinatorial problems with Constraint Programming.In this paper, we propose a related data structure called sMDD (semi-MDD) where the central layer of the diagrams is non-deterministic.We show that it is easy and efficient to transform any table (set of tuples) into an sMDD.We also introduce a new filtering algorithm, called Compact-MDD, which is based on bitwise operations, and can be applied to both MDDs and sMDDs.Our experimental results show the practical interest of our approach, both in terms of compression and filtering speed.","doi":"10.24963/ijcai.2018/192","url":"https://ijcai.org/proceedings/2018/192","pdf":"https://ijcai.org/proceedings/2018/0192.pdf","markdown":"https://ijcai.org/proceedings/2018/192.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/192","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":192,"pages":{"first":1383,"last":1389},"keywords":["Constraints and SAT: Global Constraints","Constraints and SAT: Constraint Satisfaction","Constraints and SAT: Modeling;Formulation"],"videos":[],"references":[{"position":1,"raw":"[Amilhastre et al., 2014] Jerome Amilhastre, Helene Fargier, Alexandre Niveau, and Cédric Pralet. Compiling CSPs: A complexity map of (non-deterministic) multival- ued decision diagrams. International Journal on Artificial Intelligence Tools, 23(04), 2014.","title":"Compiling CSPs: A complexity map of (non-deterministic) multivalued decision diagrams","authors":"Amilhastre","year":"2014","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Andersen et al., 2007] Henrik Andersen, Tarik Hadzic, John Hooker, and Peter Tiedemann. A constraint store based on multivalued decision diagrams. In Proceedings of CP'07, pages 118-132, 2007.","title":"A constraint store based on multivalued decision diagrams","authors":"Andersen","year":"2007","venue":"Proceedings of CP'07","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bergman et al., 2014] David Bergman, André Ciré, and Willem van Hoeve. MDD propagation for sequence constraints. Journal of Artificial Intelligence Research, 50:697-722, 2014.","title":"MDD propagation for sequence constraints","authors":"David Bergman, André Ciré, Willem Van Hoeve","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bergman et al., 2016] David Bergman, André Ciré, Willem van Hoeve, and John Hooker. Decision diagrams for opti- mization. Springer, 2016.","title":"Decision diagrams for optimization","authors":"David Bergman, André Ciré, Willem Van Hoeve, John Hooker","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Boussemart et al., 2016] Frédéric Boussemart, Christophe Lecoutre, and Cédric Piette. XCSP3: An integrated for- mat for benchmarking combinatorial constrained prob- lems. Technical Report arXiv:1611.03398, CoRR, 2016. Available from http://www.xcsp.org.","title":"XCSP3: An integrated format for benchmarking combinatorial constrained problems","authors":"Frédéric Boussemart, Christophe Lecoutre, Cédric Piette","year":"2016","venue":null,"doi":null,"url":"http://www.xcsp.org","internal_url":null},{"position":6,"raw":"[Bryant, 1986] Randal Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.","title":"Graph-based algorithms for Boolean function manipulation","authors":"Randal Bryant","year":"1986","venue":"IEEE Transactions on Computers","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cheng and Yap, 2008] Kenil Cheng and Roland Yap. Main- taining generalized arc consistency on ad-hoc r-ary con- straints. In Proceedings of CP'08, pages 509-523, 2008.","title":"Maintaining generalized arc consistency on ad-hoc r-ary constraints","authors":"Yap ; Kenil Cheng, Roland Cheng, Yap","year":"2008","venue":"Proceedings of CP'08","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cheng and Yap, 2010] Kenil Cheng and Roland Yap. An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints, 15(2):265-304, 2010.","title":"An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints","authors":"Yap ; ] Kenil Cheng, Roland Cheng, Yap","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":9,"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 reversible sparse bit-sets. In Proceedings of CP'16, pages 207-223, 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":"Proceedings of CP'16","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dolan and Moré, 2002] Elizabeth Dolan and Jorge Moré. Benchmarking optimization software with performance profiles. Mathematical programming, 91(2), 2002.","title":"Benchmarking optimization software with performance profiles","authors":"Moré Dolan, Elizabeth Dolan, Jorge Moré","year":"2002","venue":"Mathematical programming","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gange et al., 2011] Graeme Gange, Peter Stuckey, and Ra- doslaw Szymanek. MDD propagators with explanation. Constraints, 16(4):407-429, 2011.","title":"MDD propagators with explanation","authors":"Graeme Gange, Peter Stuckey, Radoslaw Szymanek","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gent et al., 2007] Ian Gent, Chris Jefferson, Ian Miguel, and Peter Nightingale. Data structures for generalised arc consistency for extensional constraints. In Proceedings of AAAI'07, pages 191-197, 2007.","title":"Data structures for generalised arc consistency for extensional constraints","authors":"Ian Gent, Chris Jefferson, Ian Miguel, Peter Nightingale","year":"2007","venue":"Proceedings of AAAI'07","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hadzic et al., 2008] Tarik Hadzic, John Hooker, Barry O'Sullivan, and Peter Tiedemann. Approximate compi- lation of constraints into multivalued decision diagrams. In Proceedings of CP'08, pages 448-462, 2008.","title":"Approximate compilation of constraints into multivalued decision diagrams","authors":"Tarik Hadzic, John Hooker, O' Barry, Peter Sullivan, Tiedemann","year":"2008","venue":"Proceedings of CP'08","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoda et al., 2010] Samid Hoda, Willem van Hoeve, and John Hooker. A systematic approach to MDD-Based con- straint programming. In Proceedings of CP'10, pages 266-280, 2010.","title":"A systematic approach to MDD-Based constraint programming","authors":"Samid Hoda, Willem Van Hoeve, John Hooker","year":"2010","venue":"Proceedings of CP'10","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lecoutre, 2011] Christophe Lecoutre. STR2: Optimized simple tabular reduction for table constraints. Constraints, 16(4):341-371, 2011.","title":"STR2: Optimized simple tabular reduction for table constraints","authors":"Christophe Lecoutre","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Perez and Régin, 2014] Guillaume Perez and Jean-Charles Régin. Improving GAC-4 for Table and MDD constraints. In Proceedings of CP'14, pages 606-621, 2014.","title":"Improving GAC-4 for Table and MDD constraints","authors":"Régin Perez, Guillaume Perez, Jean-Charles Régin","year":"2014","venue":"Proceedings of CP'14","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Perez and Régin, 2015] Guillaume Perez and Jean-Charles Régin. Efficient operations on MDDs for building con- straint programming models. In Proceedings of IJCAI'15, pages 374-380, 2015.","title":"Efficient operations on MDDs for building constraint programming models","authors":"Régin Perez, Guillaume Perez, Jean-Charles Régin","year":"2015","venue":"Proceedings of IJCAI'15","doi":null,"url":null,"internal_url":"/proceedings/2015/59"},{"position":18,"raw":"[Perez and Régin, 2017] Guillaume Perez and Jean-Charles Régin. Soft and cost MDD propagators. In Proceedings of AAAI'17, pages 3922-3928, 2017.","title":"Soft and cost MDD propagators","authors":"Régin Perez, Guillaume Perez, Jean-Charles Régin","year":"2017","venue":"Proceedings of AAAI'17","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Perez, 2017] Guillaume Perez. Decision diagrams: con- straints and algorithms. PhD thesis, Université de Nice, 2017.","title":"Decision diagrams: constraints and algorithms","authors":"Guillaume Perez","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rossi et al., 2006] Francesca Rossi, Peter van Beek, and Toby Walsh, editors. Handbook of Constraint Program- ming. Elsevier, 2006.","title":"Handbook of Constraint Programming","authors":null,"year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Verhaeghe et al., 2017] Hélène Verhaeghe, Christophe Lecoutre, Yves Deville, and Pierre Schaus. Extending compact-table to basic smart tables. In Proceedings of CP'17, pages 297-307, 2017.","title":"Extending compact-table to basic smart tables","authors":"Hélène Verhaeghe, Christophe Lecoutre, Yves Deville, Pierre Schaus","year":"2017","venue":"Proceedings of CP'17","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wang et al., 2016] Ruiwei Wang, Wei Xia, Roland Yap, and Zhanshan Li. Optimizing Simple Tabular Reduction with a bitwise representation. In Proceedings of IJCAI'16, pages 787-795, 2016.","title":"Optimizing Simple Tabular Reduction with a bitwise representation","authors":"Wang","year":"2016","venue":"Proceedings of IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/117"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}