Finding models through graph saturation
Logic in Computer Science
2018-06-26 v1 Discrete Mathematics
Programming Languages
Abstract
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these operations. We call these invariants \tr{}s that we interpret over graphs. For questions stated through sets of these sentences, this paper gives a semi-decision procedure we call graph saturation. It decides entailment over these \tr{}s, inspired on graph rewriting. We prove correctness of the procedure. Moreover, we show the corresponding decision problem to be undecidable. This confirms a conjecture previously stated by the author.
Cite
@article{arxiv.1806.09392,
title = {Finding models through graph saturation},
author = {Sebastiaan J. C. Joosten},
journal= {arXiv preprint arXiv:1806.09392},
year = {2018}
}