Termination of well-typed logic programs

Authors:
Annalisa Bossi;Nicoletta Cocco;Sabina Rossi
Affiliations:
Università di Venezia - Cà Foscari, via Torino, Mestre-Venezia, Italy;Università di Venezia - Cà Foscari, via Torino, Mestre-Venezia, Italy;Università di Venezia - Cà Foscari, via Torino, Mestre-Venezia, Italy
Venue:
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2001

Citing 16
Cited 0

Foundations of logic programming

Foundations of logic programming
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Logic programming

Handbook of theoretical computer science (vol. B)
Strong termination of logic programs

Journal of Logic Programming
Reasoning about termination of pure Prolog programs

Information and Computation
Norms on terms and their use in proving universal termination of a logic program

Theoretical Computer Science
Automatic inference of norms: a missing link in automatic termination analysis

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs

Advances in logic programming theory
From logic programming to Prolog

From logic programming to Prolog
Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination of input-consuming logic programs

Proceedings of the 1999 international conference on Logic programming
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 of Tabled Logic Programs Using Mode and Type Information

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Properties of Input-Consuming Derivations

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an extended definition of well-typed programs to general logic programs, i.e. logic programs with negated literals in the body of the clauses. This is a quite large class of programs which properly includes all the well-moded ones. We study termination properties of well-typed general programs while employing the Prolog's left-to-right selection rule. We introduce the notion of typed acceptable program and provide an algebraic characterization for the class of well-typed programs whic hterminate on all well-typed queries.