Automating the Knuth Bendix ordering
- 1 February 1990
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 28 (2) , 95-119
- https://doi.org/10.1007/bf01237233
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Rewriting systems on FP expressions to reduce the number of sequences yieldedScience of Computer Programming, 1986
- ERIL — Equational reasoning: an interactive laboratoryLecture Notes in Computer Science, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- Systems of predicative analysis, II: Representations of ordinalsThe Journal of Symbolic Logic, 1968
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952