Equational Inference, Canonical Proofs, and Proof Orderings

Leo Bachmair, Nachum Dershowitz

Research output: Contribution to journalArticlepeer-review


We describe the application of proof orderings—a technique for reasoning about inference systems-to various rewrite-based theorem-proving methods, including refinements of the standard Knuth-Bendix completion procedure based on critical pair criteria; Huet's procedure for rewriting modulo a congruence; ordered completion 1994; and a proof by consistency procedure for proving inductive theorems.

Original languageEnglish
Pages (from-to)236-276
Number of pages41
JournalJournal of the ACM
Issue number2
StatePublished - 3 Jan 1994
Externally publishedYes


  • Equational logic
  • inference systems
  • proof theory
  • rewrite systems
  • term orderings
  • term rewriting


Dive into the research topics of 'Equational Inference, Canonical Proofs, and Proof Orderings'. Together they form a unique fingerprint.

Cite this