Drags: A Compositional Algebraic Framework for Graph Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2019

Drags: A Compositional Algebraic Framework for Graph Rewriting

Abstract

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

Dates and versions

hal-03139788 , version 1 (02-08-2018)
hal-03139788 , version 2 (25-10-2021)

Licence

Identifiers

Cite

Nachum Dershowitz, Jean-Pierre Jouannaud. Drags: A Compositional Algebraic Framework for Graph Rewriting. Theoretical Computer Science, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩. ⟨hal-03139788v2⟩
171 View
146 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More