232 search results - page 1 / 47 » Termination of linear bounded term rewriting systems |
71
Voted
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
RTA
2005
Springer
15 years 3 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...
RTA
2007
Springer
15 years 3 months 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. ...
105
click to vote
ESSLLI
2009
Springer
14 years 7 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
ENTCS
2008
14 years 9 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...