Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Main track. Pages 1134-1140. https://doi.org/10.24963/ijcai.2020/158
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.
Constraints and SAT: Constraint Satisfaction
Constraints and SAT: SAT: Algorithms and Techniques