Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.

This publication has 15 references indexed in Scilit:

• On word problems in Horn theories
  Published by Springer Nature ,1988
• On the Axiomatization of “If-Then-Else”
  SIAM Journal on Computing, 1987
• Parameterized horn clause specifications: Proof theory and correctness
  Published by Springer Nature ,1987
• Function definitions in term rewriting and applicative programming
  Information and Control, 1986
• Refutational theorem proving using term-rewriting systems
  Artificial Intelligence, 1985
• Contextual rewriting
  Lecture Notes in Computer Science, 1985
• A procedure for automatically proving the termination of a set of rewrite rules
  Lecture Notes in Computer Science, 1985
• Conditional rewrite rules
  Theoretical Computer Science, 1984
• Varieties of ”If-Then-Else“
  SIAM Journal on Computing, 1983
• The construction of a complete minimal set of contextual normal forms
  Published by Springer Nature ,1983