# rewriting system

### Attenuation Regulation as a Term Rewriting System

**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

51

### Proof of termination of the rewriting system SUBST on CCL

15

### Proving Correctness of Logically Decorated Graph Rewriting Systems

**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

**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

**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

**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

**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

**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

30

### Parallel Graph Rewriting with Overlapping Rules

26

### Complexity of Acyclic Term Graph Rewriting

**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

17

### Church-Rosser Properties of Normal Rewriting

**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

**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

16

### Generic Encodings of Constructor Rewriting Systems

**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

19

### Closure of Hedge-Automata Languages by Hedge Rewriting

**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

13