98 search results - page 3 / 20 » Matrix Interpretations for Proving Termination of Term Rewri... |
RTA
2007
Springer
14 years 2 days ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
RTA
2009
Springer
14 years 15 days ago
2009
Springer
BIRTHDAY
2007
Springer
14 years 4 days ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
RTA
1993
Springer
13 years 10 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...