A simple non-termination test for the Knuth-Bendix method
Author:
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 79-88
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Computing with rewrite systemsInformation and Control, 1985
- The undecidability of self-embedding for term rewriting systemsInformation Processing Letters, 1985
- Path of subterms ordering and recursive decomposition ordering revisitedLecture Notes in Computer Science, 1985
- Computer experiments with the REVE term rewriting system generator1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A Catalogue of Canonical Term Rewriting Systems.1980
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976