Journal of Symbolic Computation
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
From logic programming to Prolog
From logic programming to Prolog
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
TALP: A Tool for the Termination Analysis of Logic Programs
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Polytool: proving termination automatically based on polynomial interpretations
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
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
Improved termination analysis of CHR using self-sustainability analysis
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
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the transformational approach which transforms LPs to term rewrite systems (TRSs) and tries to prove termination of the resulting TRSs. To this end, we adapt the well-known dependency pair framework from TRSs to LPs. With the resulting method, one can combine arbitrary termination techniques for LPs in a completely modular way and one can use both direct and transformational techniques for different parts of the same LP.