1. L. Bachmair and H. Ganzinger, 1990. On Restrictions of Ordered Paramodulation with Simplification. In Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, Lect. Notes in Comp. Sci., vol. 449, pp. 427–441, Berlin-Heidelberg-New York-Tokyo, Springer-Verlag.
2. L. Bachmair and H. Ganzinger, 1991. Rewrite-based equational theorem proving with selection and simplification. Research Report 208, Max-Planck-Institut für Informatik, Saarbrücken. Revised version to appear in the Journal of Logic and Computation.
3. Nachum Dershowitz, 1987. Termination of Rewriting. J. Symbolic Computation, Vol. 3, No. 1, pp. 69–115.
4. Z. Manna and R. Waldinger, 1980. A deductive approach to program synthesis. ACM Trans. on Progr. Lang. and Systems, Vol. 2, pp. 90–121.
5. Neil V. Murray, 1982. Completely non-clausal theorem proving. Artificial Intelligence, Vol. 18, No. 1, pp. 67–85.