Results 1 to 10 of about 1,842,530 (291)
Parallel Graph Rewriting with Overlapping Rules [PDF]
We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform ...
R. Echahed, Aude Maignan
semanticscholar +1 more source
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems [PDF]
The general form of safe recursion (or ramified recurrence) can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost ...
Naohi Eguchi
doaj +1 more source
The problem of query answering over incomplete attributed graph data is a challenging field of database management systems and artificial intelligence.
Olga Gerasimova +2 more
doaj +1 more source
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic [PDF]
Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic ...
Reiko Heckel, Paolo Torrini
doaj +1 more source
Interactions between Causal Structures in Graph Rewriting Systems [PDF]
Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that explains how ...
Ioana Cristescu +2 more
doaj +1 more source
SEER: Super-Optimization Explorer for High-Level Synthesis using E-graph Rewriting
High-level synthesis (HLS) is a process that automatically translates a software program in a high-level language into a low-level hardware description.
Jian-Yi Cheng +4 more
semanticscholar +1 more source
Tensors, !-graphs, and non-commutative quantum structures [PDF]
Categorical quantum mechanics (CQM) and the theory of quantum groups rely heavily on the use of structures that have both an algebraic and co-algebraic component, making them well-suited for manipulation using diagrammatic techniques.
Aleks Kissinger, David Quick
doaj +1 more source
Strategic port graph rewriting: an interactive modelling framework
We present strategic port graph rewriting as a basis for the implementation of visual modelling tools. The goal is to facilitate the specification and programming tasks associated with the modelling of complex systems.
M. Fernández, H. Kirchner, Bruno Pinaud
semanticscholar +1 more source
Emergence of Minkowski Spacetime by Simple Deterministic Graph Rewriting
The causal set program and the Wolfram physics project leave open the problem of how a graph that is a (3+1)-dimensional Minkowski spacetime according to its simple geodesic distances could be generated solely from simple deterministic rules.
Gabriel Leuenberger
doaj +1 more source
Computation in chemical graph rewriting networks
Biological systems are frequently viewed as performing computations that are implemented by chemical transformations underlying the turn-over of their molecular components.
Christoph Flamm +2 more
doaj +1 more source

