MOVES Seminar July 6, 2006
Automated Termination Analysis for Logic Programs by Term Rewriting
Peter Schneider-Kamp
Abstract:
Transformational approaches for termination analysis of logic programs
transform a logic program into a term rewrite system (TRS) and then
analyze termination of the resulting TRS instead.
Up to now, transformational approaches have only been applicable to
restricted classes of logic programs.
We present an improved transformation from logic programs to TRSs
which is applicable for any logic program. Thus, in the TRS we have to
handle full unficiation by matching. To this end we introduce a
modified notion of term rewriting for infinite termms and show how to
adapt state-of-the-art termination techniques to this notion.
We implemented our approach in AProVE and successfully evaluated it
on a large collection of examples.
Transformational approaches for termination analysis of logic programs
transform a logic program into a term rewrite system (TRS) and then
analyze termination of the resulting TRS instead.
Up to now, transformational approaches have only been applicable to
restricted classes of logic programs.
We present an improved transformation from logic programs to TRSs
which is applicable for any logic program. Thus, in the TRS we have to
handle full unficiation by matching. To this end we introduce a
modified notion of term rewriting for infinite termms and show how to
adapt state-of-the-art termination techniques to this notion.
We implemented our approach in AProVE and successfully evaluated it
on a large collection of examples.

