Graph Path Orderings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Graph Path Orderings


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.
Fichier principal
Vignette du fichier
GraphPathOrderingLPAR (1).pdf (422.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01903086 , version 1 (10-01-2019)


  • HAL Id : hal-01903086 , version 1


Nachum Dershowitz, Jean-Pierre Jouannaud. Graph Path Orderings. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2018, Awassa, Ethiopia. pp.1-18. ⟨hal-01903086⟩
242 View
86 Download


Gmail Facebook X LinkedIn More