@article{660ee0350a0e4fa6abccd08d0fd14ae5,
title = "Completion for rewriting modulo a congruence",
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.",
author = "Leo Bachmair and Nachum Dershowitz",
note = "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.",
year = "1989",
month = oct,
day = "3",
doi = "10.1016/0304-3975(89)90003-0",
language = "אנגלית",
volume = "67",
pages = "173--201",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier B.V.",
number = "2-3",
}