7 search results - page 1 / 2 » rta 1993 |
RTA
1993
Springer
13 years 8 months ago
1993
Springer
RTA
1993
Springer
13 years 8 months ago
1993
Springer
RTA
1993
Springer
13 years 8 months ago
1993
Springer
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
RTA
1993
Springer
13 years 8 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 ...
RTA
1993
Springer
13 years 8 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...