1. Avenhaus, J., Becker, K.: Conditional rewriting modulo a built-in algebra. SEKI Report SR-92-11, Fachbereich Informatik, Universität Kaiserslautern (1992)
2. Bachmair, L., Ganzinger, H.: On restrictions of ordered paramodulation with simplification. In: Stickel, M. E. (ed.) 10th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence, Vol.449, pp. 427?441. Berlin, Heidelberg, New York: Springer 1990
3. Bachmair, L., Ganzinger, H.: Perfect model semantics for logic programs with equality. In: Furukawa, K. (ed.) Logic Programming, Proceedings of the Eighth International Conference, pp. 645?659. The MIT Press 1991
4. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Tech. Rep. MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken (1991). Revised version to appear in J. Logic Comput.
5. Bergstra, J. A., Broy, M., Tucker, J. V., Wirsing, M.: On the power of algebraic specifications. In: Gruska, J., Chytil, M. (eds.) Mathematical Foundations of Computer Science, 10th Symposium. Lecture Notes in Computer Science, Vol.118, pp. 193?204. Berlin, Heidelberg, New York: Springer 1981