169
Voted
RTA
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...
148
click to vote
RTA
15 years 10 months ago
2005 Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
149
Voted
RTA
15 years 10 months ago
2005 Springer 
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
130
Voted
RTA
15 years 10 months ago
2005 Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
121
Voted
RTA
15 years 10 months ago
2005 Springer |
Theoretical Computer Science