Termination analysis of logic programs through combination of type-based norms

Abstract

This article makes two contributions to the work on semantics-based termination analysis for logic programs. The first involves a novel notion of type - based norm where for a given type, a corresponding norm is defined to count in a term the number of subterms of that type. This provides a collection of candidate norms, one for each type defined in the program. The second enables an analyzer to base termination proofs on the combination of several different norms. This is useful when different norms are better suited to justify the termination of different parts of the program. Application of the two contributions together consists in considering the combination of the type-based candidate norms for a given program. This results in a powerful and practical technique. Both contributions have been introduced into a working termination analyzer. Experimentation indicates that they yield state-of-the-art results in a fully automatic analysis tool, improving with respect to methods that do not use both types and combined norms.

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

“…Still, virtually all existing techniques only prove universal termination of definite logic programs, which do not use the cut "!". 3 But most realistic Prolog programs make use of the cut or related operators such as negation as failure ("\+") or if then else ("−> ... ; ..."), which can be expressed using cuts. In [18] we introduced a non-termination preserving automated transformation from logic programs with cut to definite logic programs.…”

A Transformational Approach for Proving Properties of the CHR Constraint Store

“…In particular, type information is useful in this context. When used as a basis for determining the possible calls to the program, it leads to compiler optimisations [11], more precise termination conditions [4,7] and more refined interpretations for proving termination [1,9].…”

A New Approach to Non-termination Analysis of Logic Programs

“…[13] presents a survey of the extensive amount of work up till 1994. But, most of the more powerful approaches and techniques have been introduced in the last decade: the constraint-based approach to termination analysis [5], the local approaches [4], the use of types in termination analysis [2], powerful transformational approaches [12], termination inference [7], and the porting of TRS-techniques to the LP-context [14], [9], [8].…”