On proving the termination of algorithms by machine
Artificial Intelligence
Prolog: the standard: reference manual
Prolog: the standard: reference manual
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
Termination of Nested and Mutually Recursive Algorithms
Journal of Automated Reasoning
Proving Existential Termination of Normal Logic Programs
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Efficient groundness analysis in Prolog
Theory and Practice of Logic Programming
On termination of meta-programs
Theory and Practice of Logic Programming
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)
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
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)
Automated termination analysis for logic programs with cut*
Theory and Practice of Logic Programming
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
Testing for termination with monotonicity constraints
ICLP'05 Proceedings of the 21st international conference on Logic Programming
The dependency triple framework for termination of logic programs
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
A linear operational semantics for termination and complexity analysis of ISO prolog
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
| Hi-index | 0.00 |
In very recent work, we introduced a non-termination preserving transformation from logic programs with cut to definite logic programs. While that approach allows us to prove termination of a large class of logic programs with cut automatically, in several cases the transformation results in a non-terminating definite logic program. In this paper we extend the transformation such that logic programs with cut are no longer transformed into definite logic programs, but into dependency triple problems. By the implementation of our new method and extensive experiments, we empirically evaluate the practical benefit of our contributions.