Abstract canonical inference

Maria Paola Bonacina*, Nachum Dershowitz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) fairness, which yields completeness, and uniform fairness, which yields saturation.

Original languageEnglish
Article number6
JournalACM Transactions on Computational Logic
Issue number1
StatePublished - 1 Jan 2007


  • Canonicity
  • Completeness
  • Completion
  • Fairness
  • Inference
  • Proof orderings
  • Redundancy
  • Saturation


Dive into the research topics of 'Abstract canonical inference'. Together they form a unique fingerprint.

Cite this