Chris Speirs, Zoltan Somogyi and Harald Sondergaard, Termination Analysis for Mercury. In P. Van Hentenryck, editor, Static Analysis: Proceedings of the 4th International Symposium, Lecture Notes in Computer Science. Springer, 1997. A longer version is available for download from https://www.mercurylang.org/documentation/papers/mu_97_09.ps.gz.
Gerhard Groger and Lutz Plumer, Handling of mutual recursion in automatic termination proofs for logic programs. In K. Apt, editor, The Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 336–350. MIT Press, 1992.
Chris Speirs, Termination Analysis for Logic Programs, Technical Report 97/23, Department of Computer Science, The University of Melbourne, Melbourne, Australia, 1997. Available from https://www.mercurylang.org/documentation/papers/mu_97_23.ps.gz.
K. Sagonas, The SLG-WAM: A Search-Efficient Engine for Well-Founded Evaluation of Normal Logic Programs, PhD thesis, SUNY at Stony Brook, 1996. Available from https://user.it.uu.se/~kostis/Thesis/thesis.ps.gz.
B. Demoen and K. Sagonas, CAT: the Copying Approach to Tabling, In C. Palamidessi, H. Glaser and K. Meinke, editors, Principles of Declarative Programming, 10th International Symposium, PLILP’98, Lecture Notes in Computer Science, Springer, 1998. Available form https://user.it.uu.se/~kostis/Papers/cat.ps.gz.