1. Bachmair, L. and Ganzinger, H. [1991], Perfect model semantics for logic programs with equality, in ‘Proc. International Conference on Logic Programming '91', MIT Press, pp. 645–659.
2. Bachmair, L. and Ganzinger, H. [1994], ‘Rewrite-based equational theorem proving with selection and simplification', Journal of Logic and Computation
4(3), 217–247. Revised version of Max-Planck-Institut für Informatik technical report, MPI-I-91-208, 1991.
3. Comon, H. [1995], Sequentiality, second order monadic logic and tree automata, in ‘Proceedings 10th IEEE Symposium on Logic in Computer Science, LICS'95', IEEE Computer Society Press, pp. 508–517.
4. Frühwirth, T., Shapiro, E., Vardi, M. Y. and Yardeni, E. [1991], Logic programs as types for logic programs, in A. R. Meyer, ed., ‘Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, LICS'91', IEEE Computer Society Press, pp. 300–309.
5. Jacquemard, F. [1996], Decidable approximations of term rewriting systems, in H. Ganzinger, ed., ‘Rewriting Techniques and Applications, 7th International Conference, RTA-96', Vol. 1103 of LNCS, Springer, pp. 362–376.