Modular Termination Proofs for Logic and Pure PROLOG Programs

Krzysztof R Apt,Dino Pedreschi

doi:10.1093/oso/9780198538530.003.0004

Modular Termination Proofs for Logic and Pure PROLOG Programs

Krzysztof R Apt, Dino Pedreschi

Open Access

https://doi.org/10.1093/oso/9780198538530.003.0004

Copy DOI

Publication Date: Dec 29, 1994
Citations: 9	License type: other-oa

Affiliation: University of Pisa, University of Amsterdam

#Pure PROLOG Programs #PROLOG Programs + Show 6 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text