A. K. Van-emden-m, Contributions to the theory of Logic Programming, Journal of the ACM, vol.29, issue.3, pp.841-862, 1982.

A. K. , From Logic Programming to Prolog, 1997.

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

B. De-schreye-d and . Martens-b, A General Criterion for Avoiding Infinite Unfolding during Partial Deduction, New Generation Computing, vol.11, issue.1, pp.47-79, 1991.

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

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

D. N. Lindenstrauss, N. Sagiv, and Y. Serebrenik-a, A General Framework for Automatic Termination Analysis of Logic Programs, Applicable Algebra in Engineering,Communication and Computing, vol.12, pp.117-156, 2001.

D. P. , P. Lebègue, and R. , Halting problem of one binary Horn clause is undecidable, Proc. of STACS'93, vol.665, pp.48-57, 1993.

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

G. S. and C. M. , Inferring Termination Condition for Logic Programs using Backwards Analysis, Proceedings of Logic for Programming, 2001.

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.

L. N. , TermiLog: a system for checking termination of queries to Logic Programs, 1997.

M. F. Maher-m and . Ed, 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.

M. F. Neumerkel-u, cTI: a tool for inferring termination conditions of ISO-Prolog, 2000.

M. F. Neumerkel-u.-;-cousot-p and . Ed, Applying static analysis techniques for inferring termination conditions of logic programs, Static Analysis Symposium, vol.2126, pp.93-110, 2001.

K. and ]. , The Craft Of Prolog, 1990.

S. Yuan-l.-y and Y. , Loops Checks for Logic Programs with Functions, Theoretical Computer Science, vol.266, pp.441-461, 2001.

S. D. , An Abstract Approach to Some Loop Detection Problems, Fundamenta Informaticae, vol.31, pp.195-212, 1997.

S. C. Somogyi, Z. Søndergaard, H. ;. Van-hentenryck-p, and . Ed, Termination Analysis for Mercury, Proc. of the International Static Analysis Symposium, vol.1302, pp.160-171, 1997.