{"type":"ScholarlyArticle","title":"Enumerating Potential Maximal Cliques via SAT and ASP","authors":[{"name":"Tuukka Korhonen","slug":"tuukka-korhonen","given":"Tuukka","family":"Korhonen","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":"The Bouchitté-Todinca algorithm (BT), operating dynamic programming over the so-called potential maximal cliques (PMCs), yields a practically efficient approach to treewidth and generalized hypertreewidth. The enumeration of PMCs is a scalability bottleneck for BT in practice. We propose the use of declarative solvers for PMC enumeration as a substitute for the specialized PMC enumeration algorithms employed in current BT implementations. The presented Boolean satisfiability (SAT) and answer set programming (ASP) based PMC enumeration approaches open up new possibilities for improving the efficiency of BT in practice.","doi":"10.24963/ijcai.2019/156","url":"https://ijcai.org/proceedings/2019/156","pdf":"https://ijcai.org/proceedings/2019/0156.pdf","markdown":"https://ijcai.org/proceedings/2019/156.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/156","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Constraints and SAT","track":"Main track","number":156,"pages":{"first":1116,"last":1122},"keywords":["Constraints and SAT: SAT: Applications","Constraints and SAT: SAT: Evaluation and Analysis"],"videos":[],"references":[{"position":1,"raw":"[Arnborg et al., 1987] Stefan Arnborg, Derek G. Corneil, and An- drzej Proskurowski. Complexity of finding embeddings in a k- tree. SIAM J. Alg. Discr. Meth., 8(2):277-284, 1987.","title":"Andrzej Proskurowski. Complexity of finding embeddings in a ktree","authors":"Stefan Arnborg, Derek G Corneil","year":"1987","venue":"SIAM J. Alg. Discr. Meth","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Audemard and Simon, 2018] Gilles Audemard and Laurent Si- mon. On the Glucose SAT solver. International Journal on Arti- ficial Intelligence Tools, 27(1):1-25, 2018.","title":"Gilles Audemard and Laurent Simon. On the Glucose SAT solver","authors":"Simon Audemard","year":"2018","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bailleux and Boufkhad, 2003] Olivier Bailleux and Yacine Boufkhad. Efficient CNF encoding of boolean cardinality constraints. In CP, volume 2833 of LNCS, pages 108-122. Springer, 2003.","title":"Efficient CNF encoding of boolean cardinality constraints","authors":"Boufkhad Bailleux, Olivier Bailleux, Yacine Boufkhad","year":"2003","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bannach et al., 2017] Max Bannach, Sebastian Berndt, and Thorsten Ehlers. Jdrasil: A Modular Library for Computing Tree Decompositions. In SEA, volume 75 of Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1-28:21. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.","title":"Jdrasil: A Modular Library for Computing Tree Decompositions","authors":"Bannach","year":"2017","venue":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Berg and Järvisalo, 2014] Jeremias Berg and Matti Järvisalo. SAT- based approaches to treewidth computation: An evaluation. In ICTAI, pages 328-335. IEEE, 2014.","title":"SATbased approaches to treewidth computation: An evaluation","authors":"Järvisalo Berg, Jeremias Berg, Matti Järvisalo","year":"2014","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Berry et al., 1999] Anne Berry, Jean-Paul Bordat, and Olivier Co- gis. Generating all the minimal separators of a graph. In WG, volume 1665 of LNCS, pages 167-172. Springer, 1999.","title":"Generating all the minimal separators of a graph","authors":"Anne Berry, Jean-Paul Bordat, Olivier Cogis","year":"1999","venue":"WG","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Biere et al., 2009] Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satisfiability, volume 185 of FAIA. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":"Biere","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bodlaender and Koster, 2006] Hans L. Bodlaender and Arie M.C.A. Koster. Safe separators for treewidth. Discrete Mathematics, 306(3):337-350, 2006.","title":"Safe separators for treewidth","authors":"L Hans, Arie M C A Bodlaender, Koster","year":"2006","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bodlaender and Koster, 2008] Hans L. Bodlaender and Arie M. C. A. Koster. Combinatorial optimization on graphs of bounded treewidth. Comput. J., 51(3):255-269, 2008.","title":"Combinatorial optimization on graphs of bounded treewidth","authors":"L Hans, Arie M C A Bodlaender, Koster","year":"2008","venue":"Comput. J","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bodlaender et al., 2006] Hans L. Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, and Dániel Marx. Open problems in parameterized and exact computation. Techni- cal Report UU-CS-2016-052, Utrecht University, 2006.","title":"Open problems in parameterized and exact computation","authors":"L Hans, Leizhen Bodlaender, Jianer Cai, Michael R Chen, Jan Arne Fellows, Dániel Telle, Marx","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bouchitté and Todinca, 2001] Vincent Bouchitté and Ioan Tod- inca. Treewidth and minimum fill-in: Grouping the minimal sep- arators. SIAM J. Comput., 31(1):212-232, 2001.","title":"Treewidth and minimum fill-in: Grouping the minimal separators","authors":"Vincent Bouchitté, Ioan Todinca","year":"2001","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bouchitté and Todinca, 2002] Vincent Bouchitté and Ioan Tod- inca. Listing all potential maximal cliques of a graph. Theoretical Computer Science, 276(1):17-32, 2002.","title":"Vincent Bouchitté and Ioan Todinca. Listing all potential maximal cliques of a graph","authors":"Todinca Bouchitté","year":"2002","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Darwiche, 2003] Adnan Darwiche. A differential approach to in- ference in bayesian networks. J. ACM, 50(3):280-305, 2003.","title":"A differential approach to inference in bayesian networks","authors":"Adnan Darwiche","year":"2003","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dechter, 2006] Rina Dechter. Tractable structures for constraint satisfaction problems. In Handbook of Constraint Programming, pages 209-244. Elsevier, 2006.","title":"Tractable structures for constraint satisfaction problems","authors":"Rina Dechter","year":"2006","venue":"Handbook of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dell et al., 2018] Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller. The PACE 2017 Parameterized Al- gorithms and Computational Experiments Challenge: The sec- ond iteration. In IPEC 2017, LIPIcs, pages 30:1-30:12. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2018.","title":"The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The second iteration","authors":"Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller","year":"2018","venue":"IPEC 2017, LIPIcs","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fichte et al., 2018] Johannes Klaus Fichte, Markus Hecher, Neha Lodha, and Stefan Szeider. An SMT approach to fractional hy- pertree width. In John N. Hooker, editor, CP, volume 11008 of LNCS, pages 109-127. Springer, 2018.","title":"An SMT approach to fractional hypertree width","authors":"Fichte","year":"2018","venue":"LNCS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fomin and Villanger, 2008] Fedor V. Fomin and Yngve Villanger. Treewidth computation and extremal combinatorics. In ICALP, volume 5125 of LNCS, pages 210-221. Springer, 2008.","title":"Treewidth computation and extremal combinatorics","authors":"V Fedor, Yngve Fomin, Villanger","year":"2008","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fomin et al., 2008] Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, and Yngve Villanger. Exact algorithms for treewidth and mini- mum fill-in. SIAM J. Comput., 38(3):1058-1079, 2008.","title":"Exact algorithms for treewidth and minimum fill-in","authors":"V Fedor, Dieter Fomin, Ioan Kratsch, Yngve Todinca, Villanger","year":"2008","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Freuder, 1985] Eugene C. Freuder. A sufficient condition for backtrack-bounded search. J. ACM, 32(4):755-761, 1985.","title":"A sufficient condition for backtrack-bounded search","authors":"Eugene C Freuder","year":"1985","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Ganian et al., 2019] Robert Ganian, Neha Lodha, Sebastian Ordy- niak, and Stefan Szeider. SAT-encodings for treecut width and treedepth. In ALENEX, pages 117-129. SIAM, 2019.","title":"SAT-encodings for treecut width and treedepth","authors":"Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider","year":"2019","venue":"ALENEX","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gebser et al., 2016] Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, and Philipp Wanko. Theory solving made easy with Clingo 5. In Tech. Com- mun. ICLP. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.","title":"Theory solving made easy with Clingo 5","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Philipp Wanko","year":"2016","venue":"Tech. Commun. ICLP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lif- schitz. The stable model semantics for logic programming. In ICLP/SLP, pages 1070-1080. MIT Press, 1988.","title":"The stable model semantics for logic programming","authors":"Lifschitz Gelfond","year":"1988","venue":"ICLP/SLP","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Gogate and Dechter, 2004] Vibhav Gogate and Rina Dechter. A complete anytime algorithm for treewidth. In UAI, pages 201- 208. AUAI Press, 2004.","title":"A complete anytime algorithm for treewidth","authors":"Vibhav Gogate, Rina Dechter","year":"2004","venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Gottlob et al., 2002] Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579-627, 2002.","title":"Hypertree decompositions and tractable queries","authors":"Georg Gottlob, Nicola Leone, Francesco Scarcello","year":"2002","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Gottlob et al., 2009] Georg Gottlob, Zoltán Miklós, and Thomas Schwentick. Generalized hypertree decompositions: NP- hardness and tractable variants. J. ACM, 56(6):30:1-30:32, 2009.","title":"Generalized hypertree decompositions: NPhardness and tractable variants","authors":"Gottlob","year":"2009","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Gottlob et al., 2010] Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded treewidth as a key to tractability of knowledge rep- resentation and reasoning. Artif. Intell., 174(1):105-132, 2010.","title":"Bounded treewidth as a key to tractability of knowledge representation and reasoning","authors":"Gottlob","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Grohe and Marx, 2014] Martin Grohe and Dániel Marx. Con- straint solving via fractional edge covers. ACM Transactions on Algorithms, 11(1), 2014.","title":"Constraint solving via fractional edge covers","authors":"Marx ; Grohe, Martin Grohe, Dániel Marx","year":"2014","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Korhonen et al., 2019] Tuukka Korhonen, Jeremias Berg, and Matti Järvisalo. Solving graph problems via potential maximal cliques: An experimental evaluation of the Bouchitté-Todinca al- gorithm. ACM J. Exp. Alg., 24(1:9), 2019.","title":"Solving graph problems via potential maximal cliques: An experimental evaluation of the Bouchitté-Todinca algorithm","authors":"Tuukka Korhonen, Jeremias Berg, Matti Järvisalo","year":"2019","venue":"ACM J. Exp. Alg","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Lauritzen and Spiegelhalter, 1988] Steffen L. Lauritzen and David J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. J. Roy. Statist. Soc. Ser. B, 5(2):157-224, 1988.","title":"Local computations with probabilities on graphical structures and their application to expert systems","authors":"Steffen L Lauritzen, David J Spiegelhalter","year":"1988","venue":"J. Roy. Statist. Soc. Ser. B","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Lodha et al., 2016] Neha Lodha, Sebastian Ordyniak, and Stefan Szeider. A SAT approach to branchwidth. In SAT, volume 9710 of LNCS, pages 179-195. Springer, 2016.","title":"A SAT approach to branchwidth","authors":"Neha Lodha, Sebastian Ordyniak, Stefan Szeider","year":"2016","venue":"SAT","doi":null,"url":null,"internal_url":"/proceedings/2017/689"},{"position":31,"raw":"[Lodha et al., 2017] Neha Lodha, Sebastian Ordyniak, and Stefan Szeider. SAT-encodings for special treewidth and pathwidth. In SAT, volume 10491 of LNCS, pages 429-445. Springer, 2017.","title":"SAT-encodings for special treewidth and pathwidth","authors":"Neha Lodha, Sebastian Ordyniak, Stefan Szeider","year":"2017","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Moll et al., 2012] Lukas Moll, Siamak Tazari, and Marc Thurley. Computing hypergraph width measures exactly. Information Pro- cessing Letters, 112(6):238-242, 2012.","title":"Computing hypergraph width measures exactly","authors":"Lukas Moll, Siamak Tazari, Marc Thurley","year":"2012","venue":"Information Processing Letters","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Niemelä, 1999] Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell., 25(3-4):241-273, 1999.","title":"Logic programs with stable model semantics as a constraint programming paradigm","authors":"Ilkka Niemelä","year":"1999","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Samer and Veith, 2009] Marko Samer and Helmut Veith. Encod- ing treewidth into SAT. In SAT, volume 5584 of LNCS, pages 45-50. Springer, 2009.","title":"Encoding treewidth into SAT","authors":"Veith Samer, Marko Samer, Helmut Veith","year":"2009","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Tamaki, 2017] Hisao Tamaki. Positive-instance driven dynamic programming for treewidth. In ESA, volume 87 of LIPIcs, pages 68:1-68:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.","title":"Positive-instance driven dynamic programming for treewidth","authors":"Hisao Tamaki","year":"2017","venue":"ESA","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}