Results 11 to 20 of about 1,842,530 (291)
The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the subgraph, but are ...
Roy Overbeek, Jörg Endrullis
exaly +7 more sources
Graph Rewriting Techniques in Engineering Design
Capturing human knowledge underlying the design and engineering of products has been among the main goals of computational engineering since its very beginning. Over the last decades, various approaches have been proposed to tackle this objective.
Lothar Kolbeck +3 more
doaj +2 more sources
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]
We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on ...
János Varga
doaj +3 more sources
Graph Rewriting for Graph Neural Networks [PDF]
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.
Adam Machowczyk, R. Heckel
semanticscholar +4 more sources
Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework [PDF]
We present strategic portgraph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs.
Maribel Fernández +2 more
doaj +3 more sources
Higher-order port-graph rewriting [PDF]
The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we
Maribel Fernández, Sébastien Maulat
doaj +2 more sources
Dependency Parsing with Graph Rewriting
We propose to use Graph Rewriting for parsing syntactic dependencies. We present a system of rewriting rules dedicated to French and we evaluate it by parsing the SEQUOIA corpus.
Bruno Guillaume, Guy Perrier
semanticscholar +5 more sources
A PBPO+ Graph Rewriting Tutorial [PDF]
We provide a tutorial introduction to the algebraic graph rewriting formalism PBPO+. We show how PBPO+ can be obtained by composing a few simple building blocks, and model the reduction rules for binary decision diagrams as an example.
R. Overbeek, J. Endrullis
semanticscholar +1 more source
DyCL: Dynamic Neural Network Compilation Via Program Rewriting and Graph Optimization [PDF]
The deep learning (DL) compiler serves as a vital infrastructure component to enable the deployment of deep neural networks on diverse hardware platforms such as mobile devices and Raspberry Pi. DL compiler’s primary function is to translate DNN programs
Simin Chen +3 more
semanticscholar +1 more source
Term Graph Rewriting and Parallel Term Rewriting [PDF]
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj +1 more source

