We define well-founded rewrite orderings on graphs and show that they can be used to show termination of a set of graph rewrite rules by verifying all their cyclic extensions. We then introduce the graph path ordering inspired by the recursive path ordering on terms and show that it is a well-founded rewrite ordering on graphs for which checking termination of a finite set of graph rewrite rules is decidable. Our ordering applies to arbitrary finite, directed, labeled, ordered multigraphs, hence provides a building block for rewriting with graphs, which should impact the many areas in which computations take place on graphs.
|Number of pages||19|
|Journal||EPiC Series in Computing|
|State||Published - 2018|
|Event||22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018 - Awassa, Ethiopia|
Duration: 17 Nov 2018 → 21 Nov 2018