328 search results - page 1 / 66 » Simple Termination Revisited |
CADE
1994
Springer
13 years 8 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
ENTCS
2008
13 years 4 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
COLING
1994
13 years 5 months ago
1994