76 search results - page 7 / 16 » Termination of just fair computations in term rewriting |
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
RTA
2011
Springer
12 years 10 months 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...
RTA
2004
Springer
14 years 28 days ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...