Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

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

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Resumé

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

Experiments

Citer dette

Ströder, T., Schneider-Kamp, P., & Giesl, J. (2011). Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. I Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10) (s. 184-199). Springer. Lecture Notes in Computer Science, Bind. 6564 https://doi.org/10.1007/978-3-642-20551-4_12
Ströder, Thomas ; Schneider-Kamp, Peter ; Giesl, Jürgen. / Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer, 2011. s. 184-199 (Lecture Notes in Computer Science, Bind 6564).
@inproceedings{cc93d86d2f6e4bb69dbc633ba3f7f195,
title = "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.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.",
author = "Thomas Str{\"o}der and Peter Schneider-Kamp and J{\"u}rgen Giesl",
year = "2011",
doi = "10.1007/978-3-642-20551-4_12",
language = "English",
pages = "184--199",
booktitle = "Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10)",
publisher = "Springer",
address = "Germany",

}

Ströder, T, Schneider-Kamp, P & Giesl, J 2011, Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. i Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer, Lecture Notes in Computer Science, bind 6564, s. 184-199, 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10), Hagenberg, Østrig, 25/07/2010. https://doi.org/10.1007/978-3-642-20551-4_12

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. / Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen.

Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer, 2011. s. 184-199 (Lecture Notes in Computer Science, Bind 6564).

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

TY - GEN

T1 - Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

AU - Ströder, Thomas

AU - Schneider-Kamp, Peter

AU - Giesl, Jürgen

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-20551-4_12

DO - 10.1007/978-3-642-20551-4_12

M3 - Article in proceedings

SP - 184

EP - 199

BT - Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10)

PB - Springer

ER -

Ströder T, Schneider-Kamp P, Giesl J. Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. I Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer. 2011. s. 184-199. (Lecture Notes in Computer Science, Bind 6564). https://doi.org/10.1007/978-3-642-20551-4_12