Abstract
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our methods as equational inference systems and describe techniques for reasoning about such systems.
Cite
CITATION STYLE
APA
Bachmair, L., & Dershowitz, N. (1987). Completion for rewriting modulo a congruence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 256 LNCS, pp. 192–203). Springer Verlag. https://doi.org/10.1007/3-540-17220-3_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free