232 search results - page 6 / 47 » Termination of linear bounded term rewriting systems |
FROCOS
2011
Springer
12 years 7 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
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...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
RTA
2010
Springer
13 years 11 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...
ICTAC
2004
Springer
14 years 28 days ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...