K. R. Apt, From Logic Programming to Prolog, 1997.

K. R. Apt and D. Pedreschi, Modular termination proofs for logic and pure Prolog programs, Advances in Logic Programming Theory, pp.183-229, 1994.

K. R. Apt and M. H. Van-emden, Contributions to the theory of logic programming, Journal of the ACM, vol.29, issue.3, pp.841-862, 1982.

T. Arts and H. Zantema, Termination of logic programs using semantic unification, Logic Program Synthesis and Transformation, vol.1048, 1996.

R. Bol, Loop Checking in Logic Programming, 1991.

M. Bruynooghe, D. De-schreye, and B. Martens, A general criterion for avoiding infinite unfolding during partial deduction, New Generation Computing, vol.11, issue.1, pp.47-79, 1992.

M. Codish and C. Taboch, A semantic basis for the termination analysis of logic programs, Journal of Logic Programming, vol.41, issue.1, pp.103-123, 1999.

D. De-schreye, M. Bruynooghe, and K. Verschaetse, On the existence of nonterminating queries for a restricted class of Prolog-clauses, Artificial Intelligence, vol.41, pp.237-248, 1989.

D. De-schreye and S. Decorte, Termination of logic programs : the never-ending story, Journal of Logic Programming, vol.19, issue.20, pp.199-260, 1994.

N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik, A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, vol.12, issue.1/2, pp.117-156, 2001.

P. Devienne, P. Lebègue, and J. Routier, Halting problem of one binary Horn clause is undecidable, Proc. of STACS'93, vol.665, pp.48-57, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00732053

M. Gabbrielli and R. Giacobazzi, Goal independency and call patterns in the analysis of logic programs, Proceedings of the ACM Symposium on applied computing, pp.394-399, 1994.

S. Genaim and M. Codish, Inferring termination condition for logic programs using backwards analysis, Proceedings of Logic for Programming, 2001.

R. Gori and G. Levi, Finite failure is and-compositional, Journal of Logic and Computation, vol.7, issue.6, pp.753-776, 1997.

H. J. Komorowski, Partial evaluation as a means for inferencing data structures in an applicative language : a theory and implementation in the case of Prolog, Proc. of the 9th POPL, pp.255-267, 1982.

N. Lindenstrauss, TermiLog: a system for checking termination of queries to logic programs, 1997.

F. Mesnard, Inferring left-terminating classes of queries for constraint logic programs by means of approximations, Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pp.7-21, 1996.

F. Mesnard and U. Neumerkel, cTI: a tool for inferring termination conditions of ISO-Prolog, 2000.

F. Mesnard and U. Neumerkel, Applying static analysis techniques for inferring termination conditions of logic programs, Static Analysis Symposium, vol.2126, pp.93-110, 2001.

R. O'keefe, The Craft Of Prolog, 1990.

L. Plümer, Terminations proofs for logic programs, 1990.

Y. Shen, L. Yuan, and J. You, Loops checks for logic programs with functions, Theoretical Computer Science, vol.266, issue.1-2, pp.441-461, 2001.

D. Skordev, An abstract approach to some loop detection problems, Fundamenta Informaticae, vol.31, pp.195-212, 1997.

C. Speirs, Z. Somogyi, and H. Søndergaard, Termination analysis for Mercury, Proc. of the International Static Analysis Symposium, vol.1302, pp.160-171, 1997.