Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-13T06:39:58.405Z Has data issue: false hasContentIssue false
  • English
  • Français

On modular termination proofs of general logic programs

Published online by Cambridge University Press:  23 April 2002

ANNALISA BOSSI ,
NICOLETTA COCCO ,
SABINA ROSSI  and
SANDRO ETALLE
ANNALISA BOSSI
Affiliation:
Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy
NICOLETTA COCCO
Affiliation:
Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy
SABINA ROSSI
Affiliation:
Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy
SANDRO ETALLE
Affiliation:
Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands and CWI – Center for Mathematics and Computer Science, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

We propose a modular method for proving termination of general logic programs (i.e. logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a general result for proving termination by dealing with each module separately. For programs which are in a certain sense well-behaved, namely well-moded or well-typed programs, we derive both a simple verification technique and an iterative proof method. Some examples show how our system allows for greatly simplified proofs.

Keywords

verificationterminationlogic programming
Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 2 , Issue 3 , May 2002 , pp. 263 - 291
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)