Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

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 of our contributions.
OriginalsprogEngelsk
TitelProceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10)
ForlagSpringer
Publikationsdato2011
Sider184-199
DOI
StatusUdgivet - 2011
Begivenhed20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10) - Hagenberg, Østrig
Varighed: 25. jul. 201027. jul. 2010

Konference

Konference20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10)
LandØstrig
ByHagenberg
Periode25/07/201027/07/2010
NavnLecture Notes in Computer Science
Vol/bind6564

Fingeraftryk

Dyk ned i forskningsemnerne om 'Dependency Triples for Improving Termination Analysis of Logic Programs with Cut'. Sammen danner de et unikt fingeraftryk.

Citationsformater