1385 search results - page 8 / 277 » Natural Rewriting for General Term Rewriting Systems |
116
click to vote
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
ENTCS
2008
14 years 11 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 ...
108
click to vote
SOFSEM
2010
Springer
15 years 8 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...
FLOPS
2010
Springer
15 years 6 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
107
click to vote
ENTCS
2008
14 years 11 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 ...