26 search results - page 2 / 6 » rta 2010 |
RTA
2010
Springer
13 years 8 months ago
2010
Springer
We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.
RTA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
RTA
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...