Skip to Main content Skip to Navigation
New interface
Conference papers

Drags: A Simple Algebraic Framework For Graph Rewriting

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Jean-Pierre Jouannaud Connect in order to contact the contributor
Submitted on : Sunday, August 5, 2018 - 12:06:15 PM
Last modification on : Tuesday, October 25, 2022 - 4:18:40 PM
Long-term archiving on: : Tuesday, November 6, 2018 - 12:29:00 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads