1385 search results - page 9 / 277 » Natural Rewriting for General Term Rewriting Systems |
131
Voted
RTA
1991
Springer
15 years 3 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
135
click to vote
RTA
1993
Springer
15 years 3 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
2010
Springer
15 years 3 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
RTA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...