On modular termination proofs of general logic programs

Authors:
Annalisa Bossi;Nicoletta Cocco;Sabina Rossi;Sandro Etalle
Affiliations:
Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy;Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy;Dipartimento di Informatica, Università Ca’ Foscari di Venezia, via Torino 155, 30172 Venezia, Italy;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 ...
Venue:
Theory and Practice of Logic Programming
Year:
2002

Citing 17
Cited 6

Automatic mode inference for logic programs

Journal of Logic Programming
Static inference of modes and data dependencies in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic programming

Handbook of theoretical computer science (vol. B)
Deriving descriptions of possible values of program variables by means of abstract interpretation

Journal of Logic Programming
Strong termination of logic programs

Journal of Logic Programming
Reasoning about termination of pure Prolog programs

Information and Computation
On the occur-check-free PROLOG programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modular termination proofs for logic and pure PROLOG programs

Advances in logic programming theory
From logic programming to Prolog

From logic programming to Prolog
Goal independency and call patterns in the analysis of logic programs

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination proofs for logic programs with tabling

ACM Transactions on Computational Logic (TOCL)
On the Unification Free Prolog Programs

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Modular Termination Proofs for Prolog with Tabling

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Verification of Logic Programs with Delay Declarations

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination Analysis for Mercury

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Practical methods for proving termination of general logic programs

Journal of Artificial Intelligence Research

On proving left termination of constraint logic programs

ACM Transactions on Computational Logic (TOCL)
Reuse of Results in Termination Analysis of Typed Logic Programs

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Inference of termination conditions for numerical loops in Prolog

Theory and Practice of Logic Programming
On termination of meta-programs

Theory and Practice of Logic Programming
Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination prediction for general logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.