Abstract not found

We propose a modular approach to termination proofs of general logic programs (i.e., logic programs with negation). Our approach follows the style introduced by Apt and Pedreschi for proving left termination and it is based on an extended definition of boundedness which naturally fits properties of programs preserved through LDNF-resolution. We give some examples which show how proofs can be greatly simplified by giving them independently for each module in a program.

We present the implementation of cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are no longer necessary. Instead, all provably terminating classes to all related predicates are inferred at once. The architecture of cTI and its algorithms are described. Experimentations including running times for classical examples from the logic programming termination literature and for some larger logic programs are given.