TY - JOUR
T1 - Graph path orderings
AU - Dershowitz, Nachum
AU - Jouannaud, Jean Pierre
N1 - Publisher Copyright:
© 2018, EasyChair. All rights reserved.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85088211146&partnerID=8YFLogxK
U2 - 10.29007/6hkk
DO - 10.29007/6hkk
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:85088211146
SN - 2398-7340
VL - 57
SP - 307
EP - 325
JO - EPiC Series in Computing
JF - EPiC Series in Computing
T2 - 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2018
Y2 - 17 November 2018 through 21 November 2018
ER -