1. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.
2. L. Bachmair and H. Ganzinger and C. Lynch and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172–192, 1995.
3. N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
4. M. Hermann. Constrained Reachability is NP-complete. http://www.loria.fr/hermann/publications.html#notes.
5. D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.