Inductive Completion by Ground Proof Transformation

This publication has 8 references indexed in Scilit:

• On sufficient-completeness and related properties of term rewriting systems
  Acta Informatica, 1987
• Proof by consistency
  Artificial Intelligence, 1987
• Critical-pair criteria for the Knuth-Bendix completion procedure
  Published by Association for Computing Machinery (ACM) ,1986
• Semantic confluence tests and completion methods
  Information and Control, 1985
• Completion of a set of rules modulo a set of equations
  Published by Association for Computing Machinery (ACM) ,1984
• A simplified proof of the characterization theorem for Gröbner-bases
  ACM SIGSAM Bulletin, 1980
• Proving termination with multiset orderings
  Communications of the ACM, 1979
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
  Journal of the ACM, 1974