Completion for rewriting modulo a congruence

Leo Bachmair*, Nachum Dershowitz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Completion modulo a congruence is a method for constructing a presentation of an equational theory as a rewrite system that defines unique normal forms with respect to the congruence. We formulate this completion method as an equational inference system and present techniques for proving the correctness of procedures based on the inference system. Our correctness results cover generalized and improved versions of the Peterson-Stickel and the Jouannaud-Kirchner procedure.

Original languageEnglish
Pages (from-to)173-201
Number of pages29
JournalTheoretical Computer Science
Volume67
Issue number2-3
DOIs
StatePublished - 3 Oct 1989
Externally publishedYes

Fingerprint

Dive into the research topics of 'Completion for rewriting modulo a congruence'. Together they form a unique fingerprint.

Cite this