Modular Termination Proofs for Logic and Pure PROLOG Programs
Krzysztof Rafal Apt, Dino Pedreschi · 1994
Abstract We provide a uniform and simplified presentation of the methods of Bezem (1993) (first published as (Bezem 1989)) and of Apt and Pedreschi (1993) (first published as (Apt and Pedreschi 1990)) for proving termination of logic and PROLOG programs. Then we show how these methods can be refined so that they can be used in a modular way.