11740 search results - page 14 / 2348 » More Problems in Rewriting |
CAD
2004
Springer
15 years 2 months ago
2004
Springer
165
click to vote
RTA
1993
Springer
15 years 7 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 ...
134
click to vote
ENTCS
2008
15 years 3 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 ...
126
click to vote
WADT
1997
Springer
15 years 7 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...