Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20) |
Antal sider | 7 |
Forlag | International Joint Conferences on Artificial Intelligence |
Publikationsdato | 1 jul. 2020 |
Sider | 1134-1140 |
DOI | |
Status | Udgivet - 1 jul. 2020 |
Begivenhed | 29th International Joint Conference on Artificial Intelligence (IJCAI-20) - Yokohama / Virtuel, Japan Varighed: 7 jan. 2021 → 15 jan. 2021 |
Konference
Konference | 29th International Joint Conference on Artificial Intelligence (IJCAI-20) |
---|---|
Land | Japan |
By | Yokohama / Virtuel |
Periode | 07/01/2021 → 15/01/2021 |
ID: 251872320