A dynamic approach to characterizing termination of general logic programs

Authors:
Yi-Dong Shen;Jia-Huai You;Li-Yan Yuan;Samuel S. P. Shen;Qiang Yang
Affiliations:
Chinese Academy of Sciences, Beijing, China;University of Alberta, Edmonton, Canada;University of Alberta, Edmonton, Canada;University of Alberta, Edmonton, Canada;Simon Fraser University, Burnaby, BC, Canada
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2003

Citing 19
Cited 7

Termination of rewriting

Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Efficient tests for top-down termination of logical rules

Journal of the ACM (JACM)
Signed data dependencies in logic programs

Journal of Logic Programming
Termination proofs for logic programs based on predicate inequalities

Logic programming
Termination proofs for logic programs

Termination proofs for logic programs
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
Inference of inequality constraints in logic programs (extended abstracts)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new SLDNF-tree

Information Processing Letters
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
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
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)
Loop checks for logic programs with functions

Theoretical Computer Science
SLT-Resolution for the Well-Founded Semantics

Journal of Automated Reasoning
Typed Norms for Typed Logic Programs

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation

Nontermination inference of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Novel Derivation Framework For Definite Logic Program

Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning with recursive loops under the PLP framework

ACM Transactions on Computational Logic (TOCL)
SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming

Information Security and Cryptology
Declarative specification and verification of service choreographiess

ACM Transactions on the Web (TWEB)
Experiments with Non-Termination Analysis for Java Bytecode

Electronic Notes in Theoretical Computer Science (ENTCS)
Termination prediction for general logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach that employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.