Automated inference of graph transformation rules

DOI10.46298/FI.13347MaRDI QIDQ7320396zbMATH OpenFDO

Authors Jakob L. Andersen, A. Davoodi, Rolf Fagerberg, C. Flamm, Walter Fontana, Juri Kolčák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai N. Nøjgaard

Publication date 27 August 2026

Published in Fundamenta Informaticae (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/FI.13347

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Compositionality of rewriting rules with conditions
• Double-pushout graph transformation revisited
• Functional programming languages and computer architecture. Portland, Oregon, USA, September 14-16, 1987. Proceedings. (3rd Conference)
• Graph grammars with string-regulated rewriting
• Graph transformation. 9th international conference, ICGT 2016, in memory of Hartmut Ehrig, held as part of STAF 2016, Vienna, Austria, July 5--6, 2016. Proceedings
• Graph Transformations
• scientific article; zbMATH DE number 2013202 (Why is no real title available?)
• On tables of random numbers

This page was built for publication: Automated inference of graph transformation rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320396)