The notion of fair derivation in a term-rewriting system is introduced, whereby every rewrite rule enabled infinitely often along a derivation is infinitely-often applied. A term-rewriting system is fairly-terminating iff all its fair derivations are finite. The paper presents the following question: is it decidable, for an arbitrary ground term rewriting system, whether it fairly terminates or not? A positive answer is given for several subcases. The general case remains open.
CITATION STYLE
Porat, S., & Francez, N. (1985). Fairness in term rewriting systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 202 LNCS, pp. 287–300). Springer Verlag. https://doi.org/10.1007/3-540-15976-2_14
Mendeley helps you to discover research relevant for your work.