✦ LIBER ✦

Termination is not modular for confluent variable-preserving term rewriting systems

✍ Scribed by Enno Ohlebusch

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 355 KB
Volume: 53
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00187-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Omega-Termination is Undecidable for Tot

Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems

✍ Alfons Geser 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 601 KB

We give a complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the positive integers

Overlap closures do not suffice for term

Overlap closures do not suffice for termination of general term rewriting systems

✍ Xubo Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 313 KB