Automated termination analysis for logic programs by term rewriting

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    15 Citations (Scopus)

    Abstract

    There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a term rewrite system (TRS) and then analyze termination of the resulting TRS instead. Thus, transformational approaches make all methods previously developed for TRSs available for logic programs as well. However, the applicability of most existing transformations is quite restricted, as they can only be used for certain subclasses of logic programs. (Most of them are restricted to well-moded programs.) In this paper we improve these transformations such that they become applicable for any definite logic program. To simulate the behavior of logic programs by TRSs, we slightly modify the notion of rewriting by permitting infinite terms. We show that our transformation results in TRSs which are indeed suitable for automated termination analysis. In contrast to most other methods for termination of logic programs, our technique is also sound for logic programming without occur check, which is typically used in practice. We implemented our approach in the termination prover AProVE and successfully evaluated it on a large collection of examples.
    Original languageEnglish
    Title of host publicationProceedings of the 16th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2006) 12-14 July 2006, Venice, Italy
    EditorsG. Puebla
    Place of PublicationBerlin
    PublisherSpringer
    Pages177-193
    ISBN (Print)978-3-540-71409-5
    DOIs
    Publication statusPublished - 2007
    Eventconference; LOPSTR 2006, Venice, Italy; 2007-07-12; 2007-07-14 -
    Duration: 12 Jul 200714 Jul 2007

    Publication series

    NameLecture Notes in Computer Science
    Volume4407
    ISSN (Print)0302-9743

    Conference

    Conferenceconference; LOPSTR 2006, Venice, Italy; 2007-07-12; 2007-07-14
    Period12/07/0714/07/07
    OtherLOPSTR 2006, Venice, Italy

    Fingerprint

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

    Cite this