Summary: Termination Analysis of Logic Programs based
on Dependency Graphs
Manh Thang Nguyen1
, J¨urgen Giesl2
, Peter Schneider-Kamp2
, and
Danny De Schreye1
1
Department of Computer Science, K. U. Leuven, Belgium
{ManhThang.Nguyen, Danny.DeSchreye}@cs.kuleuven.be
2
LuFG Informatik 2, RWTH Aachen, Germany
{giesl, psk}@informatik.rwth-aachen.de
Abstract. This paper introduces a modular framework for termination
analysis of logic programming. To this end, we adapt the notions of de-
pendency pairs and dependency graphs (which were developed for term
rewriting) to the logic programming domain. The main idea of the ap-
proach is that termination conditions for a program are established based
on the decomposition of its dependency graph into its strongly connected
components. These conditions can then be analysed separately by pos-