TY - JOUR
T1 - Drags
T2 - A compositional algebraic framework for graph rewriting
AU - Dershowitz, Nachum
AU - Jouannaud, Jean Pierre
N1 - Publisher Copyright:
© 2019
PY - 2019/7/19
Y1 - 2019/7/19
N2 - We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develop a rich algebra of drags that generalizes the familiar term algebra and its associated rewriting capabilities. Viewing graphs as terms provides an initial building block for rewriting with such graphs, one that should impact the many areas where computations take place on graphs.
AB - We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develop a rich algebra of drags that generalizes the familiar term algebra and its associated rewriting capabilities. Viewing graphs as terms provides an initial building block for rewriting with such graphs, one that should impact the many areas where computations take place on graphs.
KW - Drags
UR - http://www.scopus.com/inward/record.url?scp=85060922148&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.01.029
DO - 10.1016/j.tcs.2019.01.029
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85060922148
SN - 0304-3975
VL - 777
SP - 204
EP - 231
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -