1. B. Buchberger, C. Dupré, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, and W. Windsteiger. The Theorema project: A progress report. In M. Kerber and M. Kohlhase, editors, Symbolic Computation and Automated Reasoning (Proceedings of CALCULEMUS 2000), pages 98–113, St.Andrews, UK, 6–7 August 2000.
2. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2, pages 1–30. Elsevier Science, 1989.
3. L. Bachmair and H. Ganzinger. On restrictions of ordered paramodulation with simplification. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, pages 427–441, Kaiserslautern, Germany, July 1990. Springer Verlag.
4. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.
5. B. Buchberger and M. Marin. Proving by simplification. In Proceedings of the First International Theorema Workshop, RISC-Linz Technical Report 97-20, Hagenberg, Austria, 9–10 June 1997.