Termination Analysis of Logic Programs Based on Dependency Graphs

Authors:
Manh Thang Nguyen;Jürgen Giesl;Peter Schneider-Kamp;Danny Schreye
Affiliations:
Department of Computer Science, K. U. Leuven, Belgium;RWTH Aachen, Germany;RWTH Aachen, Germany;Department of Computer Science, K. U. Leuven, Belgium
Venue:
Logic-Based Program Synthesis and Transformation
Year:
2008

Citing 25
Cited 10

Termination of rewriting

Journal of Symbolic Computation
Termination proofs for logic programs

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

Theoretical Computer Science
Norms on terms and their use in proving universal termination of a logic program

Theoretical Computer Science
Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Testing Positiveness of Polynomials

Journal of Automated Reasoning
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Argument Filtering Transformation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Acceptability with General Orderings

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
cTI: a constraint-based termination inference tool for ISO-Prolog

Theory and Practice of Logic Programming
The size-change principle and dependency pairs for termination of term rewriting

Applicable Algebra in Engineering, Communication and Computing
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Polytool: proving termination automatically based on polynomial interpretations

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
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
Matrix interpretations for proving termination of term rewriting

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

Termination of Narrowing Using Dependency Pairs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automating Termination Proofs for CHR

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Research Summary: Termination of CHR

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Theory and Practice of Logic Programming
Dependency triples for improving termination analysis of logic programs with cut

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
The dependency triple framework for termination of logic programs

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Improved termination analysis of CHR using self-sustainability analysis

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Probabilistic termination of CHRiSM programs

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

Proceedings of the 14th symposium on Principles and practice of declarative programming
Non-termination analysis and cost-based query optimization of logic programs

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were developed for term rewriting) to the logic programming domain. The main idea of the approach is that termination conditions for a program are established based on the decomposition of its dependency graph into its strongly connected components. These conditions can then be analysed separately by possibly different well-founded orders. We propose a constraint-based approach for automating the framework. Then, for example, termination techniques based on polynomial interpretations can be plugged in as a component to generate well-founded orders.