Termination of rewriting systems by polynomial interpretations and its implementation
- 31 October 1987
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 9 (2) , 137-159
- https://doi.org/10.1016/0167-6423(87)90030-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- How to choose the weights in the Knuth Bendix orderingPublished by Springer Nature ,1987
- Rewriting systems on FP expressions to reduce the number of sequences yieldedScience of Computer Programming, 1986
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973
- Decision procedures for real and p‐adic fieldsCommunications on Pure and Applied Mathematics, 1969