1385 search results - page 42 / 277 » Natural Rewriting for General Term Rewriting Systems |
149
click to vote
ENTCS
2008
15 years 6 months ago
2008
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
177
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
180
click to vote
DEBS
2009
ACM
16 years 18 days ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
151
click to vote
RTA
1987
Springer
15 years 9 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
155
click to vote
MFCS
1997
Springer
15 years 10 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...