{"type":"ScholarlyArticle","title":"Unifying Core-Guided and Implicit Hitting Set Based Optimization","authors":[{"name":"Hannes Ihalainen","slug":"hannes-ihalainen","given":"Hannes","family":"Ihalainen","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"},{"name":"Jeremias Berg","slug":"jeremias-berg","given":"Jeremias","family":"Berg","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"},{"name":"Matti Järvisalo","slug":"matti-jarvisalo","given":"Matti","family":"Järvisalo","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"}],"abstract":"Two of the most central algorithmic paradigms implemented in practical solvers for maximum satisfiability (MaxSAT) and other related declarative paradigms for NP-hard combinatorial optimization are the core-guided (CG) and implicit hitting set (IHS) approaches. We develop a general unifying algorithmic framework, based on the recent notion of abstract cores, that captures both CG and IHS computations. The framework offers a unified way of establishing the correctness of variants of the approaches, and can be instantiated in novel ways giving rise to new algorithmic variants of the core-guided and IHS approaches. We illustrate the latter aspect by developing a prototype implementation of an algorithm variant for MaxSAT based on the framework.","doi":"10.24963/ijcai.2023/215","url":"https://ijcai.org/proceedings/2023/215","pdf":"https://ijcai.org/proceedings/2023/0215.pdf","markdown":"https://ijcai.org/proceedings/2023/215.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/215","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":215,"pages":{"first":1935,"last":1943},"keywords":["Constraint Satisfaction and Optimization: CSO: Satisfiabilty","Constraint Satisfaction and Optimization: CSO: Constraint optimization","Constraint Satisfaction and Optimization: CSO: Solvers and tools"],"videos":[],"references":[{"position":1,"raw":"[Abío et al., 2013] Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodríguez-Carbonell. A parametric approach for smaller and better encodings of cardinality constraints. In Principles and Practice of Constraint Pro- gramming -19th International Conference, CP 2013, vol- ume 8124 of Lecture Notes in Computer Science, pages 80-96. Springer, 2013.","title":"A parametric approach for smaller and better encodings of cardinality constraints","authors":"Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell","year":"2013","venue":"Principles and Practice of Constraint Programming -19th International Conference","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano and Dodaro, 2020] Mario Alviano and Carmine Dodaro. Unsatisfiable core analysis and aggregates for op- timum stable model search. Fundam. Informaticae, 176(3- 4):271-297, 2020.","title":"Unsatisfiable core analysis and aggregates for optimum stable model search","authors":"Dodaro Alviano, Mario Alviano, Carmine Dodaro","year":"2020","venue":"Fundam. Informaticae","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alviano et al., 2015] Mario Alviano, Carmine Dodaro, and Francesco Ricca. A MaxSAT algorithm using cardinality constraints of bounded size. In Proceedings of the Twenty- Fourth International Joint Conference on Artificial Intelli- gence, IJCAI 2015, pages 2677-2683. AAAI Press, 2015.","title":"A MaxSAT algorithm using cardinality constraints of bounded size","authors":"Mario Alviano, Carmine Dodaro, Francesco Ricca","year":"2015","venue":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/379"},{"position":4,"raw":"[Andres et al., 2012] Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, and Torsten Schaub. Unsatisfiability-based optimization in clasp. In Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, volume 17 of LIPIcs, pages 211-221.","title":"Unsatisfiability-based optimization in clasp","authors":"Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub","year":null,"venue":"Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ansótegui and Gabàs, 2017] Carlos Ansótegui and Joel Gabàs. WPM3: An (in)complete algorithm for weighted partial MaxSAT. Artificial Intelligence, 250:37-57, 2017.","title":"Carlos Ansótegui and Joel Gabàs. WPM3: An (in)complete algorithm for weighted partial MaxSAT","authors":"Gabàs Ansótegui","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ansótegui et al., 2013] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms. Artif. Intell., 196:77-105, 2013.","title":"SAT-based MaxSAT algorithms","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Ansótegui et al., 2016] Carlos Ansótegui, Joel Gabàs, and Jordi Levy. Exploiting subproblem optimization in SAT- based MaxSAT algorithms. J. Heuristics, 22(1):1-53, 2016.","title":"Exploiting subproblem optimization in SATbased MaxSAT algorithms","authors":"Carlos Ansótegui, Joel Gabàs, Jordi Levy","year":"2016","venue":"J. Heuristics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Asín et al., 2011] Roberto Asín, Robert Nieuwenhuis, Al- bert Oliveras, and Enric Rodríguez-Carbonell. Cardinality networks: A theoretical and empirical study. Constraints An Int. J., 16(2):195-221, 2011.","title":"Cardinality networks: A theoretical and empirical study","authors":"Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell","year":"2011","venue":"Constraints An Int. J","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bacchus and Narodytska, 2014] Fahiem Bacchus and Nina Narodytska. Cores in core based MaxSat algorithms: An analysis. In Theory and Applications of Satisfiability Test- ing -SAT 2014, volume 8561 of Lecture Notes in Com- puter Science, pages 7-15. Springer, 2014.","title":"Fahiem Bacchus and Nina Narodytska. Cores in core based MaxSat algorithms: An analysis","authors":"Narodytska Bacchus","year":"2014","venue":"Theory and Applications of Satisfiability Testing -SAT 2014","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bacchus et al., 2019] Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. MaxSAT Evaluation 2018: New devel- opments and detailed results. J. Satisf. Boolean Model. Comput., 11(1):99-131, 2019.","title":"Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. MaxSAT Evaluation 2018: New developments and detailed results","authors":"Bacchus","year":"2019","venue":"J. Satisf. Boolean Model. Comput","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bacchus et al., 2021] Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. Maximum Satisfiability, chapter 24, pages 929-991. Frontiers in Artificial Intelligence and Applica- tions. IOS Press BV, 2021.","title":"Fahiem Bacchus, Matti Järvisalo, and Ruben Martins","authors":"Bacchus","year":"2021","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bailleux and Boufkhad, 2003] Olivier Bailleux and Yacine Boufkhad. Efficient CNF encoding of boolean cardinal- ity constraints. In Principles and Practice of Constraint Programming -CP 2003, volume 2833 of Lecture Notes in Computer Science, pages 108-122. Springer, 2003.","title":"Efficient CNF encoding of boolean cardinality constraints","authors":"Boufkhad Bailleux, Olivier Bailleux, Yacine Boufkhad","year":"2003","venue":"Principles and Practice of Constraint Programming -CP 2003","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Berg and Järvisalo, 2019] Jeremias Berg and Matti Järvisalo. Unifying reasoning and core-guided search for maximum satisfiability. In Logics in Artificial Intelligence -16th European Conference, JELIA 2019, volume 11468 of Lecture Notes in Computer Science, pages 287-303. Springer, 2019.","title":"Unifying reasoning and core-guided search for maximum satisfiability","authors":"Järvisalo Berg, Jeremias Berg, Matti Järvisalo","year":"2019","venue":"Logics in Artificial Intelligence -16th European Conference, JELIA 2019","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Berg et al., 2020] Jeremias Berg, Fahiem Bacchus, and Alex Poole. Abstract cores in implicit hitting set MaxSat solving. In Theory and Applications of Satisfiability Test- ing -SAT 2020, volume 12178 of Lecture Notes in Com- puter Science, pages 277-294. Springer, 2020.","title":"Abstract cores in implicit hitting set MaxSat solving","authors":"Berg","year":"2020","venue":"Theory and Applications of Satisfiability Testing -SAT 2020","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Codish and Zazon-Ivry, 2010] Michael Codish and Moshe Zazon-Ivry. Pairwise cardinality networks. In Logic for Programming, Artificial Intelligence, and Reasoning -16th International Conference, LPAR-16, volume 6355 of Lecture Notes in Computer Science, pages 154-172. Springer, 2010.","title":"Pairwise cardinality networks","authors":"Michael Codish, Moshe Zazon-Ivry","year":"2010","venue":"Logic for Programming, Artificial Intelligence, and Reasoning -16th International Conference, LPAR-16","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Davies and Bacchus, 2011] Jessica Davies and Fahiem Bac- chus. Solving MAXSAT by solving a sequence of simpler SAT instances. In Principles and Practice of Constraint Programming -CP 2011, volume 6876 of Lecture Notes in Computer Science, pages 225-239. Springer, 2011.","title":"Jessica Davies and Fahiem Bacchus. Solving MAXSAT by solving a sequence of simpler SAT instances","authors":"Bacchus Davies","year":"2011","venue":"Principles and Practice of Constraint Programming -CP 2011","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Davies and Bacchus, 2013] Jessica Davies and Fahiem Bac- chus. Postponing optimization to speed up MAXSAT solv- ing. In Principles and Practice of Constraint Program- ming -19th International Conference, CP 2013, volume 8124 of Lecture Notes in Computer Science, pages 247- 262. Springer, 2013.","title":"Jessica Davies and Fahiem Bacchus. Postponing optimization to speed up MAXSAT solving","authors":"Bacchus Davies","year":"2013","venue":"Principles and Practice of Constraint Programming -19th International Conference","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Delisle and Bacchus, 2013] Erin Delisle and Fahiem Bac- chus. Solving weighted CSPs by successive relaxations. In Principles and Practice of Constraint Programming -19th International Conference, CP 2013, volume 8124 of Lec- ture Notes in Computer Science, pages 273-281. Springer, 2013.","title":"Solving weighted CSPs by successive relaxations","authors":"Bacchus Delisle","year":"2013","venue":"Principles and Practice of Constraint Programming -19th International Conference","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Devriendt et al., 2021] Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, and Peter J. Stuckey. Cut- ting to the core of pseudo-boolean optimization: Com- bining core-guided search with cutting planes reasoning. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, pages 3750-3758. AAAI Press, 2021. [Eén and Sörensson, 2003] Niklas Eén and Niklas Sörensson. Temporal induction by incremental SAT solving. In First International Workshop on Bounded Model Checking, BMC@CAV 2003, volume 89 of Elec- tronic Notes in Theoretical Computer Science, pages 543-560. Elsevier, 2003. [Eén and Sörensson, 2006] Niklas Eén and Niklas Sörensson. Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput., 2(1-4):1-26, 2006.","title":"Cutting to the core of pseudo-boolean optimization: Combining core-guided search with cutting planes reasoning","authors":"Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J Stuckey, Niklas Eén, Niklas Sörensson, ; Niklas Eén, Niklas Sörensson","year":"2003","venue":"First International Workshop on Bounded Model Checking, BMC@CAV 2003","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Fazekas et al., 2018] Katalin Fazekas, Fahiem Bacchus, and Armin Biere. Implicit hitting set algorithms for maximum satisfiability modulo theories. In Automated Reasoning - 9th International Joint Conference, IJCAR 2018, volume 10900 of Lecture Notes in Computer Science, pages 134- 151. Springer, 2018.","title":"Implicit hitting set algorithms for maximum satisfiability modulo theories","authors":"Katalin Fazekas, Fahiem Bacchus, Armin Biere","year":"2018","venue":"Automated Reasoning -9th International Joint Conference, IJCAR 2018","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Fu and Malik, 2006] Zhaohui Fu and Sharad Malik. On solving the partial MAX-SAT problem. In Proc. SAT, vol- ume 4121 of Lecture Notes in Computer Science, pages 252-265. Springer, 2006.","title":"On solving the partial MAX-SAT problem","authors":"Zhaohui Fu, Sharad Malik","year":"2006","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Gange et al., 2020] Graeme Gange, Jeremias Berg, Emir Demirovic, and Peter J. Stuckey. Core-guided and core- boosted search for CP. In Integration of Constraint Programming, Artificial Intelligence, and Operations Re- search, CPAIOR 2020, volume 12296 of Lecture Notes in Computer Science, pages 205-221. Springer, 2020.","title":"Core-guided and coreboosted search for CP","authors":"Graeme Gange, Jeremias Berg, Emir Demirovic, Peter J Stuckey","year":"2020","venue":"Artificial Intelligence, and Operations Research, CPAIOR 2020","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Heras et al., 2011] Federico Heras, António Morgado, and João Marques-Silva. Core-guided binary search algo- rithms for maximum satisfiability. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011. AAAI Press, 2011.","title":"Core-guided binary search algorithms for maximum satisfiability","authors":"Federico Heras, António Morgado, João Marques-Silva","year":"2011","venue":"Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ihalainen, 2022] Hannes Ihalainen. Refined core re- laxations for core-guided maximum satisfiability algo- rithms. Master's thesis, University of Helsinki, 2022. http://hdl.handle.net/10138/351207.","title":"Refined core relaxations for core-guided maximum satisfiability algorithms","authors":"Hannes Ihalainen, Ihalainen","year":"2022","venue":null,"doi":null,"url":"http://hdl.handle.net/10138/351207","internal_url":null},{"position":25,"raw":"[Järvisalo et al., 2012] Matti Järvisalo, Marijn Heule, and Armin Biere. Inprocessing rules. In Automated Reasoning -6th International Joint Conference, IJCAR 2012, volume 7364 of Lecture Notes in Computer Science, pages 355- 370. Springer, 2012.","title":"Inprocessing rules","authors":"Matti Järvisalo, Marijn Heule, Armin Biere","year":"2012","venue":"Automated Reasoning -6th International Joint Conference, IJCAR 2012","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Karpinski and Piotrów, 2019] Michal Karpinski and Marek Piotrów. Encoding cardinality constraints using multiway merge selection networks. Constraints An Int. J., 24(3- 4):234-251, 2019.","title":"Encoding cardinality constraints using multiway merge selection networks","authors":"Piotrów Karpinski, Michal Karpinski, Marek Piotrów","year":"2019","venue":"Constraints An Int. J","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Larrosa et al., 2011] Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, and Enric Rodríguez-Carbonell. A frame- work for certified boolean branch-and-bound optimiza- tion. J. Autom. Reason., 46(1):81-102, 2011.","title":"A framework for certified boolean branch-and-bound optimization","authors":"Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell","year":"2011","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Marques-Silva and Planes, 2007] João Marques-Silva and Jordi Planes. On using unsatisfiability for solving maxi- mum satisfiability. CoRR, abs/0712.1097, 2007.","title":"On using unsatisfiability for solving maximum satisfiability","authors":"João Marques, - Silva, Jordi Planes","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Morgado et al., 2013] António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, and João Marques-Silva. Iterative and core-guided MaxSAT solving: A survey and assessment. Constraints An Int. J., 18(4):478-534, 2013.","title":"Iterative and core-guided MaxSAT solving: A survey and assessment","authors":"António Morgado, Federico Heras, Mark H Liffiton, Jordi Planes, João Marques-Silva","year":"2013","venue":"Constraints An Int. J","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Morgado et al., 2014] António Morgado, Carmine Dodaro, and João Marques-Silva. Core-guided MaxSAT with soft cardinality constraints. In Proc. CP, volume 8656 of Lec- ture Notes in Computer Science, pages 564-573. Springer, 2014.","title":"Core-guided MaxSAT with soft cardinality constraints","authors":"António Morgado, Carmine Dodaro, João Marques-Silva","year":"2014","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Narodytska and Bacchus, 2014] Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using core- guided MaxSAT resolution. In Proc. AAAI, pages 2717-2723. AAAI Press, 2014.","title":"Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using coreguided MaxSAT resolution","authors":"Bacchus Narodytska","year":"2014","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Narodytska and Bjørner, 2022] Nina Narodytska and Niko- laj S. Bjørner. Analysis of core-guided MaxSat using cores and correction sets. In 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, volume 236 of LIPIcs, pages 26:1-26:20. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022.","title":"Analysis of core-guided MaxSat using cores and correction sets","authors":"Nina Narodytska, Nikolaj S Bjørner","year":"2022","venue":"25th International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Nieuwenhuis et al., 2006] Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam- Logemann-Loveland procedure to DPLL(t). J. ACM, 53(6):937-977, 2006.","title":"Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(t)","authors":"Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli","year":"2006","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Saikko et al., 2016] Paul Saikko, Jeremias Berg, and Matti Järvisalo. LMHS: A SAT-IP hybrid MaxSAT solver. In Theory and Applications of Satisfiability Testing, SAT 2016, volume 9710 of Lecture Notes in Computer Science, pages 539-546. Springer, 2016.","title":"LMHS: A SAT-IP hybrid MaxSAT solver","authors":"Paul Saikko, Jeremias Berg, Matti Järvisalo","year":"2016","venue":"Theory and Applications of Satisfiability Testing, SAT 2016","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Saikko et al., 2018] Paul Saikko, Carmine Dodaro, Mario Alviano, and Matti Järvisalo. A hybrid approach to op- timization in answer set programming. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, pages 32-41. AAAI Press, 2018.","title":"A hybrid approach to optimization in answer set programming","authors":"Paul Saikko, Carmine Dodaro, Mario Alviano, Matti Järvisalo","year":"2018","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Sinz, 2005] Carsten Sinz. Towards an optimal CNF encod- ing of boolean cardinality constraints. In Principles and Practice of Constraint Programming -CP 2005, volume 3709 of Lecture Notes in Computer Science, pages 827- 831. Springer, 2005.","title":"Towards an optimal CNF encoding of boolean cardinality constraints","authors":"Carsten Sinz, Sinz","year":"2005","venue":"Principles and Practice of Constraint Programming -CP 2005","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Smirnov et al., 2021] Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. Pseudo-boolean optimization by im- plicit hitting sets. In 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, volume 210 of LIPIcs, pages 51:1-51:20. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2021.","title":"Pseudo-boolean optimization by implicit hitting sets","authors":"Smirnov","year":"2021","venue":"27th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Smirnov et al., 2022] Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. Improvements to the implicit hitting set approach to pseudo-boolean optimization. In 25th Inter- national Conference on Theory and Applications of Satis- fiability Testing, SAT 2022, volume 236 of LIPIcs, pages 13:1-13:18. Schloss Dagstuhl -Leibniz-Zentrum für In- formatik, 2022.","title":"Improvements to the implicit hitting set approach to pseudo-boolean optimization","authors":"Smirnov","year":"2022","venue":"25th International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}