1385 search results - page 52 / 277 » Natural Rewriting for General Term Rewriting Systems |
199
click to vote
MST
2006
15 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
152
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
180
click to vote
BDA
2007
15 years 7 months ago
2007
Query personalization was introduced as an advanced mechanism to allow the reformulation of database queries and adapt them to the user's domain of interest and preferences. ...
155
click to vote
FLOPS
2008
Springer
15 years 7 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
197
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...