412 search results - page 7 / 83 » Completion for Multiple Reduction Orderings |
MODELS
2009
Springer
13 years 12 months ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
IJSI
2008
13 years 7 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
DCC
2009
IEEE
14 years 8 months ago
2009
IEEE
Multiple Description (MD) source coding is a method to overcome unexpected information loss in a diversity system such as the internet, or a wireless network. While classic MD cod...
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
ENTCS
2008
13 years 7 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...