@inproceedings{81b6c5ae92c843e7b02adf2da9605033,
title = "Normalization via rewrite closures",
abstract = "We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.",
author = "L. Bachmair and Ramakrishnan, \{C. R.\} and Ramakrishnan, \{I. V.\} and A. Tiwari",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 10th International Conference on Rewriting Techniques and Applications, RTA 1999 ; Conference date: 02-07-1999 Through 04-07-1999",
year = "1999",
doi = "10.1007/3-540-48685-2\_15",
language = "English",
isbn = "3540662014",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "190--204",
editor = "Paliath Narendran and Michael Rusinowitch",
booktitle = "Rewriting Techniques and Applications - 10th International Conference, RTA 1999, Proceedings",
}