Subgraph Isomorphism uses a small graph as a pattern to identify within a larger graph a set of vertices that have matching edges. This paper addresses a logic program written in Prolog for a specific relatively complex graph pattern for which multiple conventional implementations (including parallel) exist. The goal is to understand the complexity differences between programming logically and programming conventionally. Discussion includes the process of converting the graph pattern into logic statements in Prolog, and the resulting characteristics as the size of the graph increased. The analysis shows that using a logic paradigm is an efficient way to attack complex graph problems.
@article{arxiv.2511.13600,
title = {Subgraph Isomorphism: Prolog vs. Conventional},
author = {Claire Y. Yin and Peter M. Kogge},
journal= {arXiv preprint arXiv:2511.13600},
year = {2026}
}