Graph Rewriting for Graph Neural Networks

Adam Machowczyk, Reiko Heckel
5/29/2023
cs.LGcs.NE

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

Given graphs as input, Graph Neural Networks (GNNs) support the inference of nodes, edges, attributes, or graph properties. Graph Rewriting investigates the rule-based manipulation of graphs to model complex graph transformations. We propose that, therefore, (i) graph rewriting subsumes GNNs and could serve as formal model to study and compare them, and (ii) the representation of GNNs as graph rewrite systems can help to design and analyse GNNs, their architectures and algorithms. Hence we propose Graph Rewriting Neural Networks (GReNN) as both novel semantic foundation and engineering discipline for GNNs. We develop a case study reminiscent of a Message Passing Neural Network realised as a Groove graph rewriting model and explore its incremental operation in response to dynamic updates.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{machowczyk2023graph,
  title  = {Graph Rewriting for Graph Neural Networks},
  author = {Adam Machowczyk and Reiko Heckel},
  year   = {2023},
  eprint = {2305.18632},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.18632v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.18632.svg)](https://codeofpaper.com/paper/2305.18632)

Discussion