Abstract
In this paper, two topics will be examined. First, the general path ordering will be applied to three conditional rewrite systems to show termination. Second, the relationship between forward closures and innermost rewriting will be discussed. This leads one to consider completion limited to innermost derivations. The ability to easily extend innermost and outermost forward closures is examined.
Cite
CITATION STYLE
Hoot, C. (1995). Termination for restricted derivations and conditional rewrite systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 968, pp. 206–222). Springer Verlag. https://doi.org/10.1007/3-540-60381-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
