Thomas Ströder

 

  Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

 

 

Abstract:

In very recent work, we introduced a non-termination preserving
transformation from logic programs with cut to definite logic
programs. While that approach allows us to prove termination of a
large class of logic programs with cut automatically, in several
cases the transformation results in a non-terminating definite logic
program. We extend the transformation such that logic programs with
cut are no longer transformed into definite logic programs, but into
dependency triple problems. By the implementation of our new method
and extensive experiments, we empirically evaluate the practical
benefit of our contributions.