209 search results - page 11 / 42 » Termination of Priority Rewriting |
157
click to vote
RTA
2005
Springer
15 years 10 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
118
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
119
click to vote
RTA
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...
141
click to vote
RTA
2009
Springer
15 years 11 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
135
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...