{"type":"ScholarlyArticle","title":"Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions","authors":[{"name":"Stephan Gocht","slug":"stephan-gocht","given":"Stephan","family":"Gocht","affiliation":"Lund University , Lund , Sweden; University of Copenhagen , Copenhagen , Denmark"},{"name":"Ciaran McCreesh","slug":"ciaran-mccreesh","given":"Ciaran","family":"McCreesh","affiliation":"University of Glasgow , Glasgow , Scotland"},{"name":"Jakob Nordström","slug":"jakob-nordstrom","given":"Jakob","family":"Nordström","affiliation":"University of Copenhagen , Copenhagen , Denmark; Lund University , Lund , Sweden"}],"abstract":"Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in complexity theory. This allows us to extend a state of the art subgraph isomorphism enumeration solver with proof logging support, so that the solutions it outputs may be audited and verified for correctness and completeness by a simple third party tool which knows nothing about graph theory.","doi":"10.24963/ijcai.2020/158","url":"https://ijcai.org/proceedings/2020/158","pdf":"https://ijcai.org/proceedings/2020/0158.pdf","markdown":"https://ijcai.org/proceedings/2020/158.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/158","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":"Constraints and SAT","track":"Main track","number":158,"pages":{"first":1134,"last":1140},"keywords":["Constraints and SAT: Constraint Satisfaction","Constraints and SAT: SAT: Algorithms and Techniques"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25223/file_25223.m3u8","length_sec":252,"provider":"hls"}],"references":[{"position":1,"raw":"[Archibald et al., 2019] Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, and James Trimble. Sequential and parallel solution-biased search for subgraph algorithms. In Louis-Martin Rousseau and Kostas Stergiou, editors, Integration of Constraint Programming, Artificial Intelligence, and Operations Re- search -16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings, vol- ume 11494 of Lecture Notes in Computer Science, pages 20-38. Springer, 2019.","title":"Sequential and parallel solution-biased search for subgraph algorithms","authors":"Archibald","year":"2019","venue":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research -16th International Conference, CPAIOR 2019","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Audemard et al., 2014] Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, and Daniel Cosmin Porumbel. Scoring-based neighborhood dominance for the subgraph isomorphism problem. In Barry O'Sullivan, editor, Principles and Practice of Con- straint Programming -20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, volume 8656 of Lecture Notes in Computer Science, pages 125-141. Springer, 2014.","title":"Scoring-based neighborhood dominance for the subgraph isomorphism problem","authors":"Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel","year":"2014","venue":"Principles and Practice of Constraint Programming -20th International Conference, CP 2014","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonnici et al., 2013] Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis E. Shasha, and Alfredo Ferro. A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinformatics, 14(S-7):S13, 2013.","title":"A subgraph isomorphism algorithm and its application to biochemical data","authors":"Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis E Shasha, Alfredo Ferro","year":"2013","venue":"BMC Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cook et al., 1987] William J. Cook, Collette R. Coullard, and György Turán. On the complexity of cutting-plane proofs. Discrete Applied Mathematics, 18(1):25-38, 1987.","title":"On the complexity of cutting-plane proofs","authors":"William J Cook, Collette R Coullard, György Turán","year":"1987","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cordella et al., 2004] Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. A (sub)graph isomor- phism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10):1367-1372, 2004.","title":"A (sub)graph isomorphism algorithm for matching large graphs","authors":"Luigi P Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento","year":"2004","venue":"IEEE Trans. Pattern Anal. Mach. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Elffers et al., 2020] Jan Elffers, Stephan Gocht, Ciaran Mc- Creesh, and Jakob Nordström. Justifying all differences using pseudo-boolean reasoning. In Proceedings of AAAI, 2020.","title":"Justifying all differences using pseudo-boolean reasoning","authors":"Elffers","year":"2020","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Goldberg and Novikov, 2003] Evguenii I. Goldberg and Yakov Novikov. Verification of proofs of unsatisfiabil- ity for CNF formulas. In 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pages 10886-10891. IEEE Computer Society, 2003.","title":"Verification of proofs of unsatisfiability for CNF formulas","authors":"Goldberg, I Novikov ; Evguenii, Yakov Goldberg, Novikov","year":"2003","venue":"2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Haken, 1985] Armin Haken. The intractability of resolu- tion. Theor. Comput. Sci., 39:297-308, 1985.","title":"The intractability of resolution","authors":"Armin Haken","year":"1985","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Heule et al., 2013a] Marijn Heule, Warren A. Hunt Jr., and Nathan Wetzler. Trimming while checking clausal proofs. In Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013, pages 181-188. IEEE, 2013.","title":"Trimming while checking clausal proofs","authors":"Heule","year":"2013","venue":"Formal Methods in Computer-Aided Design, FMCAD 2013","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Heule et al., 2013b] Marijn Heule, Warren A. Hunt Jr., and Nathan Wetzler. Verifying refutations with extended reso- lution. In Maria Paola Bonacina, editor, Automated De- duction -CADE-24 -24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings, volume 7898 of Lecture Notes in Com- puter Science, pages 345-359. Springer, 2013.","title":"Verifying refutations with extended resolution","authors":"Heule","year":"2013","venue":"Automated Deduction -CADE-24 -24th International Conference on Automated Deduction","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kotthoff et al., 2016] Lars Kotthoff, Ciaran McCreesh, and Christine Solnon. Portfolios of subgraph isomorphism al- gorithms. In Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, editors, Learning and Intelligent Optimiza- tion -10th International Conference, LION 10, Ischia, Italy, May 29 -June 1, 2016, Revised Selected Papers, vol- ume 10079 of Lecture Notes in Computer Science, pages 107-122. Springer, 2016.","title":"Portfolios of subgraph isomorphism algorithms","authors":"Kotthoff","year":"2016","venue":"Learning and Intelligent Optimization -10th International Conference, LION 10","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lecoutre et al., 2007] Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. Nogood recording from restarts. In IJCAI 2007, Proceedings of the 20th In- ternational Joint Conference on Artificial Intelligence, Hy- derabad, India, January 6-12, 2007, pages 131-136, 2007.","title":"Nogood recording from restarts","authors":"Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal","year":"2007","venue":"IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2007/19"},{"position":13,"raw":"[Lee et al., 2016] Jimmy H. M. Lee, Christian Schulte, and Zichen Zhu. Increasing nogoods in restart-based search. In Dale Schuurmans and Michael P. Wellman, editors, Pro- ceedings of the Thirtieth AAAI Conference on Artificial In- telligence, February 12-17, 2016, Phoenix, Arizona, USA, pages 3426-3433. AAAI Press, 2016.","title":"Increasing nogoods in restart-based search","authors":"H M Jimmy, Christian Lee, Zichen Schulte, Zhu","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[McCreesh and Prosser, 2015] Ciaran McCreesh and Patrick Prosser. A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In Gilles Pesant, ed- itor, Principles and Practice of Constraint Programming -21st International Conference, CP 2015, Cork, Ireland, August 31 -September 4, 2015, Proceedings, volume 9255 of Lecture Notes in Computer Science, pages 295-312. Springer, 2015.","title":"A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs","authors":"Ciaran Mccreesh, Patrick Prosser","year":"2015","venue":"Principles and Practice of Constraint Programming -21st International Conference, CP 2015","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McCreesh et al., 2018] Ciaran McCreesh, Patrick Prosser, Christine Solnon, and James Trimble. When subgraph iso- morphism is really hard, and why this matters for graph databases. J. Artif. Intell. Res., 61:723-759, 2018.","title":"When subgraph isomorphism is really hard, and why this matters for graph databases","authors":"Ciaran Mccreesh, Patrick Prosser, Christine Solnon, James Trimble","year":"2018","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Solnon, 2010] Christine Solnon. Alldifferent-based filtering for subgraph isomorphism. Artif. Intell., 174(12-13):850- 864, 2010.","title":"Alldifferent-based filtering for subgraph isomorphism","authors":"Christine Solnon","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Solnon, 2019] Christine Solnon. Experimental evaluation of subgraph isomorphism solvers. In Donatello Conte, Jean- Yves Ramel, and Pasquale Foggia, editors, Graph-Based Representations in Pattern Recognition -12th IAPR-TC- 15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings, volume 11510 of Lecture Notes in Computer Science, pages 1-13. Springer, 2019.","title":"Experimental evaluation of subgraph isomorphism solvers","authors":"Christine Solnon","year":"2019","venue":"Graph-Based Representations in Pattern Recognition -12th IAPR-TC-15 International Workshop, GbRPR 2019","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wetzler et al., 2014] Nathan Wetzler, Marijn Heule, and Warren A. Hunt Jr. Drat-trim: Efficient checking and trim- ming using expressive clausal proofs. In Carsten Sinz and Uwe Egly, editors, Theory and Applications of Satisfia- bility Testing -SAT 2014 -17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, volume 8561 of Lecture Notes in Computer Science, pages 422- 429. Springer, 2014.","title":"Drat-trim: Efficient checking and trimming using expressive clausal proofs","authors":"Nathan Wetzler, Marijn Heule, Warren A Hunt","year":"2014","venue":"Theory and Applications of Satisfiability Testing -SAT 2014 -17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zampelli et al., 2010] Stéphane Zampelli, Yves Deville, and Christine Solnon. Solving subgraph isomorphism problems with constraint programming. Constraints, 15(3):327-353, 2010.","title":"Solving subgraph isomorphism problems with constraint programming","authors":"Stéphane Zampelli, Yves Deville, Christine Solnon","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}