232 search results - page 20 / 47 » Termination of linear bounded term rewriting systems |
CTRS
1987
15 years 1 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
JAR
2006
14 years 9 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
RTA
2010
Springer
14 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
TCS
1998
14 years 9 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...