Standard Completion

  • Leo Bachmair
Part of the Progress in Theoretical Computer Science book series (PTCS)


Knuth and Bendix (1970) proposed a procedure that attempts to transform a given set of equations into a convergent rewrite system. This completion procedure must be supplied with a reduction ordering, which determines the direction in which an equation is to be oriented into a rewrite rule. It deduces new equations by a process called superposition. An intriguing feature of the procedure is that rewrite rules can be used to simplify other, already deduced equations. Terms can therefore be kept in fully simplified form and redundant equations can be discarded. Deduction and simplification are the two main components of completion. While simplification accounts for the practicality of completion, it also complicates the task of verifying that a procedure is correct (i. e., does in fact produce a convergent set of equations).


Inference System Inference Rule Transformation Rule Proof Step Completion Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1991

Authors and Affiliations

  • Leo Bachmair
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations