TY - JOUR
T1 - Completion for rewriting modulo a congruence
AU - Bachmair, Leo
AU - Dershowitz, Nachum
N1 - Funding Information:
* This is a substantially revised version of a paper presented at the Second Internat. Conf: on Rewriting Techniques and Applicafions (Bordeaux, France, May 1987). This research was supported in part by the National Science Foundation under Grant DCR 85.13417.
PY - 1989/10/3
Y1 - 1989/10/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0024960706&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(89)90003-0
DO - 10.1016/0304-3975(89)90003-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0024960706
SN - 0304-3975
VL - 67
SP - 173
EP - 201
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 2-3
ER -