Drag Rewriting
Logic in Computer Science
2024-06-28 v2
Abstract
We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags enjoy a rich algebraic structure with sums and products. Drag rewriting naturally extends graph rewriting, dag rewriting, and term rewriting models.
Keywords
Cite
@article{arxiv.2406.16046,
title = {Drag Rewriting},
author = {Nachum Dershowitz and Jean-Pierre Jouannaud and Fernando Orejas},
journal= {arXiv preprint arXiv:2406.16046},
year = {2024}
}