How to choose the weights in the Knuth Bendix ordering

This publication has 10 references indexed in Scilit:

• An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations
  Published by Springer Nature ,1986
• Termination
  Published by Springer Nature ,1985
• Path of subterms ordering and recursive decomposition ordering revisited
  Published by Springer Nature ,1985
• ERIL — Equational reasoning: an interactive laboratory
  Lecture Notes in Computer Science, 1985
• Computer experiments with the REVE term rewriting system generator
  Published by Association for Computing Machinery (ACM) ,1983
• Orderings for term-rewriting systems
  Theoretical Computer Science, 1982
• Equations and Rewrite Rules: A Survey
  Published by Elsevier ,1980
• Computing in systems described by equations
  Lecture Notes in Computer Science, 1977
• 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 ordinals
  The Journal of Symbolic Logic, 1968