Termination prediction for general logic programs

Authors:
Yi-dong Shen;Danny de Schreye;Dean Voets
Affiliations:
State key laboratory of computer science, institute of software, chinese academy of sciences, beijing 100190, china (e-mail: ydshen@ios.ac.cn);Department of computer science, celestijnenlaan 200 a, b-3001 heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.ac.be, dean.voets@cs.kuleuven.ac.be);Department of computer science, celestijnenlaan 200 a, b-3001 heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.ac.be, dean.voets@cs.kuleuven.ac.be)
Venue:
Theory and Practice of Logic Programming
Year:
2009

Citing 26
Cited 3

Efficient loop detection in Prolog using the tortoise-and-hare technique

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
Reasoning about termination of pure Prolog programs

Information and Computation
Mixtus: an automatic partial evaluator for full Prolog

New Generation Computing
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
An extended variant of atoms loop check for positive logic programs

New Generation 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)
Loop checks for logic programs with functions

Theoretical Computer Science
Proving Existential Termination of Normal Logic Programs

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Termination of Logic Programs Using Semantic Unification

LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
TALP: A Tool for the Termination Analysis of Logic Programs

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
TermiLog: A System for Checking Termination of Queries to Logic Programs

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A dynamic approach to characterizing termination of general logic programs

ACM Transactions on Computational Logic (TOCL)
On modular termination proofs of general logic programs

Theory and Practice of Logic Programming
Inferring termination conditions for logic programs using backwards analysis

Theory and Practice of Logic Programming
cTI: a constraint-based termination inference tool for ISO-Prolog

Theory and Practice of Logic Programming
Nontermination inference of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical methods for proving termination of general logic programs

Journal of Artificial Intelligence Research
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Detecting non-termination of term rewriting systems using an unfolding operator

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Polynomial interpretations as a basis for termination analysis of logic programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Research Summary: Non-termination Analysis of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A New Approach to Non-termination Analysis of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Non-termination analysis of logic programs using types

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a heuristic framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/nontermination proof approaches. We introduce an idea of termination prediction, which predicts termination of a logic program in case that neither a termination nor a non-termination proof is applicable. We establish a necessary and sufficient characterization of infinite (generalized) SLDNF-derivations with arbitrary (concrete or moded) queries, and develop an algorithm that predicts termination of general logic programs with arbitrary nonfloundering queries. We have implemented a termination prediction tool and obtained quite satisfactory experimental results. Except for five programs which break the experiment time limit, our prediction is 100% correct for all 296 benchmark programs of the Termination Competition 2007, of which 18 programs cannot be proved by any of the existing state-of-the-art analyzers like AProVE07, NTI, Polytool, and TALP.