1. Bachmair, L. & Ganzinger, H. (1990), On restrictions of ordered paramodulation with simplification, in M. Stickel, ed., ‘Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern', Vol. 449 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 427–441.
2. Bachmair, L. & Ganzinger, H. (1994), ‘Rewrite-based equational theorem proving with selection and simplification', J. Logic and Computation 4(3), 217–247. Revised version of Technical Report MPI-I-91-208, 1991.
3. Bachmair, L. & Ganzinger, H. (1995), Ordered chaining calculi for first-order theories of binary relations, Research Report MPI-I-95-2-009, Max-Planck-Institut für Informatik, Saarbrücken, Saarbrücken. Revised version to appear in JACM. URL: www.mpi-sb.mpg.de/~hg/pra.html#MPI-I-95-2-009
4. Bachmair, L. & Ganzinger, H. (1997), Strict basic superposition and chaining, Research Report MPI-I-97-2-011, Max-Planck-Institut für Informatik, Saarbrücken, Saarbrücken. URL: www.mpi-sb.mpg.de/~hg/pra.html#MPI-I-97-2-011
5. Bachmair, L., Ganzinger, H., Lynch, C. & Snyder, W. (1992), Basic paramodulation and superposition, in D. Kapur, ed., ‘Automated Deduction — CADE'11', Vol. 607 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 462–476.