Ordered Completion

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


Standard completion fails whenever an equation st is generated, such that s and t are irreducible, yet incomparable with respect to the given reduction ordering. Examples of such unorientable equations are commutativity axioms x · yy · x, as the two terms x · y and y · x are incomparable with respect to any reduction ordering.


Inference Rule Critical Pair Horn Clause Ground Term Ground Instance 


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