Equational Inference, Canonical Proofs, and Proof Orderings

Leo Bachmair; Nachum Dershowitz

doi:10.1145/174652.174655

Equational Inference, Canonical Proofs, and Proof Orderings

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	236-276
Number of pages	41
Journal	Journal of the ACM
Volume	41
Issue number	2
DOIs	https://doi.org/10.1145/174652.174655
State	Published - 3 Jan 1994
Externally published	Yes

Keywords

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

Access to Document

10.1145/174652.174655

Cite this

@article{5200343b0ac34c89b084c22a682f44db,

title = "Equational Inference, Canonical Proofs, and Proof Orderings",

abstract = "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.",

keywords = "Equational logic, inference systems, proof theory, rewrite systems, term orderings, term rewriting",

author = "Leo Bachmair and Nachum Dershowitz",

year = "1994",

month = jan,

day = "3",

doi = "10.1145/174652.174655",

language = "אנגלית",

volume = "41",

pages = "236--276",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Equational Inference, Canonical Proofs, and Proof Orderings

AU - Bachmair, Leo

AU - Dershowitz, Nachum

PY - 1994/1/3

Y1 - 1994/1/3

N2 - 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.

AB - 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.

KW - Equational logic

KW - inference systems

KW - proof theory

KW - rewrite systems

KW - term orderings

KW - term rewriting

UR - http://www.scopus.com/inward/record.url?scp=85032070107&partnerID=8YFLogxK

U2 - 10.1145/174652.174655

DO - 10.1145/174652.174655

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85032070107

SN - 0004-5411

VL - 41

SP - 236

EP - 276

JO - Journal of the ACM

JF - Journal of the ACM

IS - 2

ER -

Equational Inference, Canonical Proofs, and Proof Orderings

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this