Automated termination analysis for logic programs with cut

P. Schneider-Kamp, J. Giesl, T. Stroeder, A. Serebrenik, R. Thiemann

    Research output: Contribution to journalArticleAcademicpeer-review

    29 Citations (Scopus)

    Abstract

    Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-free program implies termination of the original program. Hence after this pre-processing, any technique for proving termination of definite logic programs can be applied. We implemented this pre-processing in our termination prover AProVE and evaluated it successfully with extensive experiments. Keywords: automated termination analysis; cut; definite logic programs.
    Original languageEnglish
    Pages (from-to)365-381
    JournalTheory and Practice of Logic Programming
    Volume10
    Issue number4-6
    DOIs
    Publication statusPublished - 2010

    Fingerprint

    Dive into the research topics of 'Automated termination analysis for logic programs with cut'. Together they form a unique fingerprint.

    Cite this