| Home > Publications > Reports > Informatics (CW) |
CW 496
Manh Thang Nguyen, Peter Schneider-Kamp, Danny De Schreye, Jürgen Giesl
Termination analysis of logic programs based on dependency graphs
Abstract
This paper introduces a modular framework for termination analysis of logic programming. To this end, the notion of dependency graph and cycle analysis techniques are adapted to the logic programming domain. The main idea of the approach is that termination conditions for a program are established based on the decomposition of its dependency graph into its strongly connected components, which then can be analysed on its own by using different well-founded quasi orders.
We propose a constraint-based approach for automating the framework in which the termination technique based on polynomial interpretation can be plugged in as an independent component to generate well-founded quasi orders.
report.pdf (224K) / mailto: M.-T. Nguyen