Drags: A Simple Algebraic Framework For Graph Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Drags: A Simple Algebraic Framework For Graph Rewriting


We are interested here in a natural generalization of term rewriting techniques to what we call drags, viz. finite, directed, ordered multigraphs. Each vertex is labeled by a function symbol, the arity of which governs the number of vertices to which it relates by an incoming edge in the graph. To this end, we develop a rich algebra of drags which generalizes the familiar term algebra and its associated rewriting capabilities. Viewing graphs as terms provides an initial building block for rewriting with such graphs, that should impact the many areas where computations take place on graphs.
Fichier principal
Vignette du fichier
GraphRewritingTG-Final.pdf (212.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01853836 , version 1 (05-08-2018)


  • HAL Id : hal-01853836 , version 1


Nachum Dershowitz, Jean-Pierre Jouannaud. Drags: A Simple Algebraic Framework For Graph Rewriting. TERMGRAPH 2018 - 10th International Workshop on Computing with Terms and Graphs, Jul 2018, Oxford, United Kingdom. ⟨hal-01853836⟩
129 View
189 Download


Gmail Facebook X LinkedIn More