Completion procedures as transition rules + control

This publication has 8 references indexed in Scilit:

• An overview of LP, the Larch Prover
  Lecture Notes in Computer Science, 1989
• Existence, Uniqueness, and Construction of Rewrite Systems
  SIAM Journal on Computing, 1988
• A completion procedure for conditional equations
  Published by Springer Nature ,1988
• Termination of rewriting systems by polynomial interpretations and its implementation
  Science of Computer Programming, 1987
• Transformation ordering
  Published by Springer Nature ,1987
• Computer experiments with the REVE term rewriting system generator
  Published by Association for Computing Machinery (ACM) ,1983
• A complete proof of correctness of the Knuth-Bendix completion algorithm
  Journal of Computer and System Sciences, 1981
• 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