{"type":"ScholarlyArticle","title":"Learning When to Use Automatic Tabulation in Constraint Model Reformulation","authors":[{"name":"Carlo Cena","slug":"carlo-cena","given":"Carlo","family":"Cena","affiliation":"Department of Computer Science and Engineering , University of Bologna , Italy"},{"name":"Özgür Akgün","slug":"ozgur-akgun","given":"Özgür","family":"Akgün","affiliation":"School of Computer Science , University of St Andrews , U.K."},{"name":"Zeynep Kiziltan","slug":"zeynep-kiziltan","given":"Zeynep","family":"Kiziltan","affiliation":"Department of Computer Science and Engineering , University of Bologna , Italy"},{"name":"Ian Miguel","slug":"ian-miguel","given":"Ian","family":"Miguel","affiliation":"School of Computer Science , University of St Andrews , U.K."},{"name":"Peter Nightingale","slug":"peter-nightingale","given":"Peter","family":"Nightingale","affiliation":"Department of Computer Science , University of York , U.K."},{"name":"Felix Ulrich-Oltean","slug":"felix-ulrich-oltean","given":"Felix","family":"Ulrich-Oltean","affiliation":"Department of Computer Science , University of York , U.K."}],"abstract":"Combinatorial optimisation has numerous practical applications, such as planning, logistics, or circuit design. Problems such as these can be solved by approaches such as Boolean Satisfiability (SAT) or Constraint Programming (CP). Solver performance is affected significantly by the model chosen to represent a given problem, which has led to the study of model reformulation. One such method is tabulation: rewriting the expression of some of the model constraints in terms of a single “table” constraint. Successfully applying this process means identifying expressions amenable to trans- formation, which has typically been done manually. Recent work introduced an automatic tabulation using a set of hand-designed heuristics to identify constraints to tabulate. However, the performance of these heuristics varies across problem classes and solvers. Recent work has shown learning techniques to be increasingly useful in the context of automatic model reformulation. The goal of this study is to understand whether it is possible to improve the performance of such heuristics, by learning a model to predict whether or not to activate them for a given instance. Experimental results suggest that a random forest classifier is the most robust choice, improving the performance of four different SAT and CP solvers.","doi":"10.24963/ijcai.2023/211","url":"https://ijcai.org/proceedings/2023/211","pdf":"https://ijcai.org/proceedings/2023/0211.pdf","markdown":"https://ijcai.org/proceedings/2023/211.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/211","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":211,"pages":{"first":1902,"last":1910},"keywords":["Machine Learning: ML: Classification","Constraint Satisfaction and Optimization: CSO: Solvers and tools","Constraint Satisfaction and Optimization: CSO: Modeling"],"videos":[],"references":[{"position":1,"raw":"[Akgün et al., 2018] Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, and András Z. Salamon. Automatic discovery and exploitation of promis- ing subproblems for tabulation. In Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming, (CP), volume 11008 of Lecture Notes in Computer Science, pages 3-12. Springer, Cham, 2018.","title":"Automatic discovery and exploitation of promising subproblems for tabulation","authors":"Ian P Özgür Akgün, Christopher Gent, Ian Jefferson, Peter Miguel, András Z Nightingale, Salamon","year":"2018","venue":"Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Akgün et al., 2022] Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, P. Nightingale, András Z. Salamon, and Felix Ulrich-Oltean. Automatic tabulation in constraint models. ArXiv, abs/2202.13250, 2022.","title":"Automatic tabulation in constraint models","authors":"Ian P Özgür Akgün, Christopher Gent, Zeynep Jefferson, Ian Kiziltan, P Miguel, Nightingale, Z András, Felix Salamon, Ulrich-Oltean","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amadini et al., 2014] Roberto Amadini, Maurizio Gab- brielli, and Jacopo Mauro. An enhanced features extrac- tor for a portfolio of constraint solvers. In Proceedings of the 29th Annual ACM Symposium on Applied Comput- ing, SAC '14, page 1357-1359. Association for Comput- ing Machinery, 2014.","title":"An enhanced features extractor for a portfolio of constraint solvers","authors":"Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro","year":"2014","venue":"Proceedings of the 29th Annual ACM Symposium on Applied Computing, SAC '14","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bacchus, 2007] Fahiem Bacchus. Gac via unit propagation. In International conference on principles and practice of constraint programming, pages 133-147. Springer, 2007.","title":"Fahiem Bacchus. Gac via unit propagation","authors":"Bacchus","year":"2007","venue":"International conference on principles and practice of constraint programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Biere et al., 2009] Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh. Handbook of satisfiability, volume 185 of Frontiers in Artificial Intelligence and Ap- plications. IOS Press, first edition, 2009.","title":"Handbook of satisfiability","authors":"Armin Biere, J H Marijn, Heule, Toby Hans Van Maaren, Walsh","year":"2009","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Biere et al., 2020] Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximillian Heisinger. Cadical, kissat, para- cooba entering the sat competition 2021. In Proceedings of SAT Competition 2020: Solver and Benchmark Descrip- tions, volume B-2020-1 of Department of Computer Sci- ence Report Series B, pages 51-53. University of Helsinki, 2020.","title":"Cadical, kissat, paracooba entering the sat competition 2021","authors":"Biere","year":"2020","venue":"Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Breiman, 2001] Leo Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.","title":"Leo Breiman. Random forests","authors":"Breiman","year":"2001","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cocke, 1970] John Cocke. Global common subexpression elimination. The Association for Computing Machin- ery Special Interest Group on Programming Languages, 5(7):20-24, 1970.","title":"Global common subexpression elimination","authors":"John Cocke","year":"1970","venue":"The Association for Computing Machinery Special Interest Group on Programming Languages","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dekker et al., 2017] Jip J. Dekker, Gustav Björdal, Mats Carlsson, Pierre Flener, and Jean-Noël Monette. Auto- tabling for subproblem presolving in minizinc. Con- straints, 22(4):512-529, 2017.","title":"Autotabling for subproblem presolving in minizinc","authors":"J Jip, Gustav Dekker, Mats Björdal, Pierre Carlsson, Jean-Noël Flener, Monette","year":"2017","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":10,"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 Michel Rueher, editor, Principles and Practice of Constraint Programming, pages 207-223. Springer International Publishing, 2016.","title":"Compacttable: 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","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Espasa et al., 2022] Joan Espasa, Ian Miguel, and Mateu Villaret. Plotting: A planning problem with complex tran- sitions. In International Conference on Principles and Practice of Constraint Programming, (CP), volume 235 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1-22:17. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022.","title":"Plotting: A planning problem with complex transitions","authors":"Espasa","year":"2022","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gargani and Refalo, 2007] Antoine Gargani and Philippe Refalo. An efficient model and strategy for the steel mill slab design problem. In International Conference on Prin- ciples and Practice of Constraint Programming, 2007.","title":"An efficient model and strategy for the steel mill slab design problem","authors":"Refalo Gargani, Antoine Gargani, Philippe Refalo","year":"2007","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gent et al., 2006] Ian P. Gent, Chris Jefferson, and Ian Miguel. Minion: A fast, scalable, constraint solver. In Proceedings of the 2006 Conference on Artificial Intelli- gence, page 98-102. IOS Press, 2006.","title":"Minion: A fast, scalable, constraint solver","authors":"Ian P Gent, Chris Jefferson, Ian Miguel","year":"2006","venue":"Proceedings of the 2006 Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gent et al., 2007] Ian P. Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Bar- bara M. Smith, and S. Armagan Tarim. Search in the patience game 'black hole'. AI Commununications, 20(3):211-226, 2007.","title":"Search in the patience game 'black hole","authors":"Ian P Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M Smith, S Armagan Tarim","year":"2007","venue":"AI Commununications","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gent et al., 2010] Ian P. Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Neil C. A. Moore, Peter Nightingale, and Karen E. Petrie. Learning when to use lazy learning in constraint solving. In European Conference on Artificial Intelligence, (ECAI), volume 215 of Frontiers in Artificial Intelligence and Applications, pages 873-878, 2010.","title":"Learning when to use lazy learning in constraint solving","authors":"Ian P Gent, Christopher Jefferson, Lars Kotthoff, Ian Miguel, C A Neil, Peter Moore, Karen E Nightingale, Petrie","year":"2010","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hurley et al., 2014] Barry Hurley, Lars Kotthoff, Yuri Mal- itsky, and Barry O'Sullivan. Proteus: A Hierarchical Port- folio of Solvers and Transformations. In Helmut Simonis, editor, Integration of AI and OR Techniques in Constraint Programming, Lecture Notes in Computer Science, pages 301-317. Springer International Publishing, 2014.","title":"Proteus: A Hierarchical Portfolio of Solvers and Transformations","authors":"Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O' Sullivan","year":"2014","venue":"Integration of AI and OR Techniques in Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[IBM Knowledge Center, 2022] IBM Knowledge Center. The strong constraint, 2022.","title":"IBM Knowledge Center. The strong constraint","authors":null,"year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Le Provost and Wallace, 1992] Thierry Le Provost and Mark Wallace. Domain independent propagation. In Proceedings of FGCS: International Conference on Fifth Generation Computer Systems, pages 1004-1011. IOS Press, 1992.","title":"Domain independent propagation","authors":"Le Provost, Wallace ; Thierry, Le Provost, Mark Wallace","year":"1992","venue":"Proceedings of FGCS: International Conference on Fifth Generation Computer Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lindauer et al., 2015] Marius Lindauer, Holger H. Hoos, Frank Hutter, and Torsten Schaub. AutoFolio: An Au- tomatically Configured Algorithm Selector. Journal of Ar- tificial Intelligence Research, 53:745-778, 2015.","title":"AutoFolio: An Automatically Configured Algorithm Selector","authors":"Marius Lindauer, H Holger, Frank Hoos, Torsten Hutter, Schaub","year":"2015","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lloyd and Shepherdson, 1991] John W. Lloyd and John C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3-4):217-242, 1991.","title":"Partial evaluation in logic programming","authors":"John W Lloyd, John C Shepherdson","year":"1991","venue":"The Journal of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Nethercote et al., 2007] Nicholas Nethercote, Peter James Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack. Minizinc: Towards a standard cp mod- elling language. In International Conference on Principles and Practice of Constraint Programming, (CP), volume 4741 of Lecture Notes in Computer Science, pages 529- 543. Springer, Berlin, Heidelberg, 2007.","title":"Minizinc: Towards a standard cp modelling language","authors":"Nicholas Nethercote, Peter James Stuckey, Ralph Becket, Sebastian Brand, Gregory J Duck, Guido Tack","year":"2007","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Nightingale et al., 2017] Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, and Patrick Spracklen. Automatically improving constraint models in savile row. Artificial Intelligence, 251:35-61, 2017.","title":"Automatically improving constraint models in savile row","authors":"Peter Nightingale, Özgür Akgün, Ian P Gent, Christopher Jefferson, Ian Miguel, Patrick Spracklen","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nightingale, 2022] Peter Nightingale. Savile Row Manual. ArXiv, abs/2201.03472, 2022.","title":"Savile Row Manual","authors":"Peter Nightingale","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rodriguez et al., 2013] María Andreína Francísco Ro- driguez, Pierre Flener, and Justin Pearson. Generation of implied constraints for automaton-induced decompo- sitions. In Proceedings of the 2013 IEEE International Conference on Tools with Artificial Intelligence, ICTAI '13, page 1076-1083. IEEE Computer Society, 2013.","title":"María Andreína Francísco Rodriguez, Pierre Flener, and Justin Pearson. Generation of implied constraints for automaton-induced decompositions","authors":"Rodriguez","year":"2013","venue":"Proceedings of the 2013 IEEE International Conference on Tools with Artificial Intelligence, ICTAI '13","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rossi et al., 2006] Francesca Rossi, P. V. Beek, and Toby Walsh. Handbook of Constraint Programming. Founda- tions of Artificial Intelligence. Elsevier Science Inc., first edition, 2006.","title":"Handbook of Constraint Programming","authors":"Francesca Rossi, P V Beek, Toby Walsh","year":"2006","venue":"Foundations of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Stojadinović and Marić, 2014] Mirko Stojadinović and Filip Marić. meSAT: Multiple encodings of CSP to SAT. Constraints, 19(4):380-403, 2014.","title":"meSAT: Multiple encodings of CSP to SAT","authors":"Marić Stojadinović, Mirko Stojadinović, Filip Marić","year":"2014","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Ulrich-Oltean et al., 2022] Felix Ulrich-Oltean, Peter Nightingale, and James Alfred Walker. Selecting sat en- codings for pseudo-boolean and linear integer constraints. In International Conference on Principles and Practice of Constraint Programming, (CP), volume 235 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:17. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022.","title":"Selecting sat encodings for pseudo-boolean and linear integer constraints","authors":"Ulrich-Oltean","year":"2022","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}