Results 51 to 60 of about 1,842,530 (291)
Datalog Rewritings of Regular Path Queries using Views [PDF]
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
Infinitary Term Graph Rewriting is Simple, Sound and Complete [PDF]
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the ...
Bahr, Patrick; id_orcid, Bahr, Patrick
core +1 more source
SPARQL Query Rewriting for Implementing Data Integration over Linked Data [PDF]
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community. The presence on the Web of such a huge information cloud, ranging from academic to geographic to gene related information ...
Gianluca Correndo +9 more
core +2 more sources
Structured Operational Semantics for Graph Rewriting [PDF]
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
In-place Graph Rewriting with Interaction Nets [PDF]
An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of an algorithm ...
Ian Mackie, Shinya Sato
doaj +1 more source
Star to mesh transformations are well-known in electrical engineering, and are reminiscent of local complementation for graph states in qudit stabilizer quantum mechanics.
Cockett, Robin +2 more
doaj +1 more source
Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting [PDF]
In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design ...
Koko Muroya, Dan R. Ghica
doaj +1 more source
Evaluating the performance of model transformation styles in Maude [PDF]
Rule-based programming has been shown to be very successful in many application areas. Two prominent examples are the specification of model transformations in model driven development approaches and the definition of structured operational semantics of
Lluch-Lafuente, Alberto +4 more
core +1 more source
Typed lambda-terms in categorical attributed graph transformation [PDF]
This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules.
Bertrand Boisvert +2 more
doaj +1 more source
Termination of Injective DPO Graph Rewriting Systems Using Subgraph Counting
. A machine-checkable sufficient condition for relative termination of double-pushout graph rewriting systems with injective rules on edge-labeled multigraphs is presented.
Qi Qiu
semanticscholar +1 more source

