Extended Abstract
This research was supported in part by the National Science Foundation under grant DCR 85-13417.
References
L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. To appear in Theor. Comput. Sci. (1988).
L. Bachmair and N. Dershowitz. Critical pair criteria for completion. J. Sym. Comput. (1988) 6:1–18.
J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput. (1986) 15:1155–1194.
D. Kapur, D.R. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. J. Sym. Comput. (1988) 6:19–36.
D. Knuth and P. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, Oxford, 1970, pp. 263–297.
G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. J. ACM (1981) 28:233–264.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmair, L., Dershowitz, N. (1989). A critical pair criterion for completion modulo a congruence. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_151
Download citation
DOI: https://doi.org/10.1007/3-540-51517-8_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51517-3
Online ISBN: 978-3-540-48207-9
eBook Packages: Springer Book Archive