Termination of Logic Programs: Transformational Methods Revisited

Ohlebusch, Enno

doi:10.1007/s002000100064

Cited by 31 publications

(28 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this TRS cannot be used for complexity analysis, as irc R(Gr ) is linear whereas the runtime complexity of the original logic program is quadratic. For an analogous reason, complexity analysis of such examples is also not possible by transformations from logic programs to TRSs like [32,34].…”

Section: From Evaluation Graphs To Trss -Complexity Analysismentioning

confidence: 99%

See 1 more Smart Citation

Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs

Giesl

Ströder

Schneider–Kamp

et al. 2013

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

There exist many powerful techniques to analyze termination and complexity of term rewrite systems (TRSs). Our goal is to use these techniques for the analysis of other programming languages as well. For instance, approaches to prove termination of definite logic programs by a transformation to TRSs have been studied for decades. However, a challenge is to handle languages with more complex evaluation strategies (such as Prolog, where predicates like the cut influence the control flow). In this paper, we present a general methodology for the analysis of such programs. Here, the logic program is first transformed into a symbolic evaluation graph which represents all possible evaluations in a finite way. Afterwards, different analyses can be performed on these graphs. In particular, one can generate TRSs from such graphs and apply existing tools for termination or complexity analysis of TRSs to infer information on the termination or complexity of the original logic program.

show abstract

Section: From Evaluation Graphs To Trss -Complexity Analysismentioning

confidence: 99%

“…For well-moded definite logic programs, there are several transformations to TRSs such that termination of the TRS implies termination of the original logic program [32]. We extended these transformations to arbitrary definite programs in [34].…”

Section: Introductionmentioning

confidence: 99%

Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs

Giesl

Ströder

Schneider–Kamp

et al. 2013

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…Our encoding is similar to the well known technique of unraveling which transforms conditional into unconditional TRSs [14,16]. 3 For example, R log is defined as follows and completely contains R half .…”

Section: Encoding Expressions and Defining Equationsmentioning

confidence: 99%

Termination of Isabelle Functions via Termination of Rewriting

Krauß

Sternagel

Thiemann

et al. 2011

Interactive Theorem Proving

View full text Add to dashboard Cite

Abstract. We show how to automate termination proofs for recursive functions in (a first-order subset of) Isabelle/HOL by encoding them as term rewrite systems and invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, the main challenge is the formal reduction of the proof obligation produced by Isabelle/HOL to the termination of the corresponding term rewrite system. We automate this reduction via suitable tactics which we added to the IsaFoR library.

show abstract

“…Moreover, one could also admit ITRSs with conditions and indeed, our implementation also works on conditional ITRSs. This is no additional difficulty, because conditional (I)TRSs can be automatically transformed into unconditional ones [23]. E.g., the ITRS R1 below could result from the transformation of this conditional ITRS:…”

Section: Definition 1 (Itrs)mentioning

confidence: 99%