Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata
Contributor : Jean-Pierre Jouannaud Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 11:27:44 AM
Last modification on : Friday, January 21, 2022 - 3:11:25 AM
Long-term archiving on: : Wednesday, January 26, 2022 - 7:26:20 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License



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



Les métriques sont temporairement indisponibles