Quasi-Termination Analysis of Logic Programs Using Size-Change Graphs ∗

Abstract

A logic program is quasi-terminating when only a finite number of different calls—up to variable renaming—are derivable from any given goal. Ensuring the quasi-termination of programs w.r.t. a class of goals is a relevant problem in several areas, like tabled evaluation or partial evaluation, where quasi-termination implies the full termination of the… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics