Kruskal's Tree Theorem for Acyclic Term Graphs

Abstract

In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For this we adapt the homeomorphic embedding relation to term graphs. In contrast to earlier extensions, our notion is inspired by morphisms. Based on this, we establish a variant of Kruskal's Tree Theorem formulated for acyclic term graphs. In proof, we rely on the new notion of embedding and follow Nash-Williams' minimal bad sequence argument. Finally, we propose a variant of the lexicographic path order for acyclic term graphs.

Termination of Graph Transformation Systems using Weighted Subgraph Counting

“…There also exist a variety of methods that generalize TRS methods (such as simplification orderings) to term graphs [20,26,28] and drags [10].…”