103 search results - page 3 / 21 » Polygraphs for termination of left-linear term rewriting sys... |
104
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 ...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
107
click to vote
RTA
2011
Springer
14 years 9 days ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
122
click to vote
RTA
1993
Springer
15 years 1 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 ...