Results 21 to 30 of about 2,591 (261)
Graph Rewriting and Relabeling with PBPO$$^{+}$$ [PDF]
, 2021 We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called \pbpostrong, exerts more control over the embedding of the pattern in the host graph, which is important for a large class of graph rewrite systems.
Roy Overbeek +2 more
openaire +4 more sources
Electronic Notes in Theoretical Computer Science, 2005 AbstractWe investigate synchronized hyperedge replacement (SHR) as general framework for distributed programming and system design. We propose a slender version of SHR which dramaticaly reduces the mathematical overhead of the original proposal [G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchronization with mobility.
CENCIARELLI, Pietro +2 more
openaire +3 more sources
, 1987 Graph rewriting (also called reduction) as defined in Wadsworth [1971] was introduced in order to be able to give a more efficient implementation of functional programming languages in the form of lambda calculus or term rewrite systems: identical subterms are shared using pointers.
Barendregt, H.P. +5 more
openaire +2 more sources
Graph Rewriting for Graph Neural Networks
, 2023 Originally submitted to ICGT 2023, part of STAF ...
Adam Machowczyk, Reiko Heckel
openaire +3 more sources
Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is based on a partial order and a metric on term graphs.
Patrick Bahr
doaj +1 more source
Engineering Grammar-Based Type Checking for Graph Rewriting Languages
IEEE Access, 2022 The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent)
Naoki Yamamoto, Kazunori Ueda
doaj +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Scientific Annals of Computer Science, 2012 Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general ...
A. Dorman, T. Heindel, B. König
doaj +1 more source
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshihiro Mizoguchi, Yasuo Kawahara
openaire +2 more sources
Datalog Rewritings of Regular Path Queries using Views [PDF]
Logical Methods in Computer Science, 2015 We consider query answering using views on graph databases, i.e. databases structured as edge-labeled graphs. We mainly consider views and queries specified by Regular Path Queries (RPQ).
Nadime Francis +2 more
doaj +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general.
Andrei Dorman, Tobias Heindel
doaj +1 more source