Year: 1996
Type: other
Abstract: In this paper we present a n umberofnecessary conditions for the existence of loops, i.e. reductions of the form t !+ R c [t].We investigate which of the known termination preserving transformation methods also preserve the non-existence of loops.We c haracterize the existence of loops by overlap closures.We illustrate these methods at new examples of a one-rule term rewriting system and a two-rule string rewriting system which admit a non-terminating reduction but no loop.
Authors: Hans Zantema, Alfons Geser
Institution: University of Passau
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1554090710