| | |
Summary: Dependency Triples for Improving Termination
Analysis of Logic Programs with Cut
Thomas Str¨oder1
, Peter Schneider-Kamp2
, and J¨urgen Giesl1
1
LuFG Informatik 2, RWTH Aachen University, Germany
{stroeder,giesl}@informatik.rwth-aachen.de
2
IMADA, University of Southern Denmark, Denmark
petersk@imada.sdu.dk
Abstract. In very recent work, we introduced a non-termination pre-
serving 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 trans-
formation results in a non-terminating definite logic program.
In this paper 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
|
