Automated termination analysis for logic programs by term rewriting

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

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    18 Citaten (Scopus)


    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.
    Originele taal-2Engels
    TitelProceedings of the 16th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2006) 12-14 July 2006, Venice, Italy
    RedacteurenG. Puebla
    Plaats van productieBerlin
    ISBN van geprinte versie978-3-540-71409-5
    StatusGepubliceerd - 2007
    Evenementconference; LOPSTR 2006, Venice, Italy; 2007-07-12; 2007-07-14 -
    Duur: 12 jul. 200714 jul. 2007

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743


    Congresconference; LOPSTR 2006, Venice, Italy; 2007-07-12; 2007-07-14
    AnderLOPSTR 2006, Venice, Italy


    Duik in de onderzoeksthema's van 'Automated termination analysis for logic programs by term rewriting'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit