rewriting system
Attenuation Regulation as a Term Rewriting System
... term rewriting system. In section 5 we refine the previous system and decorate its transitions with rates, thus obtaining a representation of the Markov chain by a probabilistic term rewriting ...
15
Graph Rewriting System for Consistent Evolution of RDF/S databases
... applied: there is no individual node Excipient ; the algorithm stops. According to the method chosen for dealing and ordering side-effects on line 2 of Algorithm 1, inconsistent updates may result in cycles. As shown ...
51
Proof of termination of the rewriting system SUBST on CCL
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
15
Proving Correctness of Logically Decorated Graph Rewriting Systems
... decorated rewriting systems where the left-hand sides are endowed with logical formulas which help to express positive as well as negative application conditions, in addition to classical ...graph rewriting ...
16
On a Dynamic Logic for Graph Rewriting
... graph rewriting, research could be done on term rewriting with this rich and powerful layer of language of graph ...graph rewriting, its syntax and its semantics. In Section 4 the rewriting ...
17
Cubical categories for homotopy and rewriting
... for rewriting theory are [ 4 ], and [ 10 ] for the particular case of string ...word rewriting system to be confluent, it is enough to show the confluence of the local branchings, that is the ...
186
Reachability Analysis of Innermost Rewriting
... type system is enriched by logic formulas and arithmetic like [29, 5], but they generally require to annotate the output of the function for type checking to ...type system but, instead, only to observe and ...
18
On a Dynamic Logic for Graph Rewriting
... graph rewriting, research could be done on term rewriting with this rich and powerful layer of language of graph ...graph rewriting, its syntax and its semantics. In Section 4 the rewriting ...
16
On Term Rewriting Systems Having a Rational Derivation
... Word rewriting systems are among the most general formalisms found in com- puter science to model word ...word rewriting systems proposed in [4], which is to consider the ‘Cayley graph’ of a ...
24
Reduction Operators and Completion of Rewriting Systems
... Given a word w, we denote by [w] the class of w for the equivalence relation induced by R. The order < being total and well-founded, [w] admits a smallest element. Let M be the application from X ∗ to itself mapping a ...
30
Parallel Graph Rewriting with Overlapping Rules
... P : P l ∪ P r → P l 0 ∪ P r 0 such that, the elements in N l 0 and P r 0 are new and the restrictions of h a to l → l 0 (respectively r → r 0 ) are graph isomorphisms. In general, parts of a left-hand side of a rule ...
26
Complexity of Acyclic Term Graph Rewriting
... rewrite system (TRS for short) under an outermost reduction strategy, in each step the recursive call is ...term rewriting would profit from a more direct representation of the heap as a graph, rather than ...
19
Free inverse monoids up to rewriting
... T (I) = [ (a,b)∈I {(ab, ba), (ba, ab), (ba, ab), (ab, ba)} Then it make sense to define F IM (T (I)) to be the free partially semi-commutative inverse monoid generated by A and induced by I. When I is symmetric, that is ...
17
Church-Rosser Properties of Normal Rewriting
... art. Rewriting with rules only (when E and S are both empty) is called plain rewrit- ...plain rewriting reduces, under a termination assumption, to the joinability of its critical pairs, which are minimal ...
16
Complex correspondences for query patterns rewriting
... a rewriting percentage of 90% of the Music patterns: on the 19 subgraphs (subpatterns) identified in the patterns for Music, we were able to transform 17 of ...SWIP system along the DBpedia data set, in ...
14
Request Rewriting-Based Web Service Discovery
... [10] proposes to use process ontologies to describe the behaviour of services and then to query such ontologies using a Process Query Language (PQL). Chakraborty et al. [8] defines an ont[r] ...
16
Generic Encodings of Constructor Rewriting Systems
... [ paint(car(electric, !suv)) _ bl ue, paint (car(!diesel, !suv))) _ whit e, paint (x) _ red ] Similarly to plain term rewriting systems (TRS), i.e. TRS without anti-patterns and ordered rules, it is interesting to ...
20
Query Rewriting On Path Views Without Integrity Constraints
... This problem appears in particular in data integration settings, where databases are incomplete, and the equivalent rewritings usually fail to deliver re- sults. Therefore, data integration systems often use maximally ...
19
Closure of Hedge-Automata Languages by Hedge Rewriting
... related rewriting concepts. In particular we define hedge rewriting systems (HRS) and context-free rewrite ...for rewriting systems containing rules that are inverse ...
16
Rewriting SELECT SPARQL queries from 1:n complex correspondences
... 6. Euzenat, J., Scharffe, F., Zimmermann, A.: Expressive alignment language and implementation. Tech. rep., INRIA (2007), http://hal.inria.fr/hal-00822892/ 7. Gillet, P., Trojahn, C., Haemmerlé, O., Pradel, C.: Complex ...
13