 
Summary: Automated Termination Analysis for
Logic Programs by Term Rewriting #
P. SchneiderKamp 1 , J. Giesl 1 , A. Serebrenik 2 , and R. Thiemann 1
1 LuFG Informatik 2, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany,
{psk,giesl,thiemann}@informatik.rwthaachen.de
2 Dept. of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513,
5600 MB Eindhoven, The Netherlands, a.serebrenik@tue.nl
Abstract. There are two kinds of approaches for termination analysis of
logic programs: ``transformational'' and ``direct'' ones. Direct approaches
prove termination directly on the basis of the logic program. Transforma
tional approaches transform a logic program into a term rewrite system
(TRS) and then analyze termination of the resulting TRS instead. Thus,
transformational approaches make all methods previously developed for
TRSs available for logic programs as well. However, the applicability of
most existing transformations is quite restricted, as they can only be used
for certain subclasses of logic programs. (Most of them are restricted to
wellmoded programs.) In this paper we improve these transformations
such that they become applicable for any definite logic program. To si
mulate the behavior of logic programs by TRSs, we slightly modify the
notion of rewriting by permitting infinite terms. We show that our trans
