Automated termination analysis for logic programs with cut*

Authors:
Peter Schneider-kamp;JÜrgen Giesl;Thomas StrÖder;Alexander Serebrenik;RenÉ Thiemann
Affiliations:
Department of mathematics and computer science, university of southern denmark, denmark;Lufg informatik 2, rwth aachen university, germany;Lufg informatik 2, rwth aachen university, germany;Department of mathematics and computer science, tu eindhoven, the netherlands;Institute of computer science, university of innsbruck, austria
Venue:
Theory and Practice of Logic Programming
Year:
2010

Citing 20
Cited 10

Simple operational and denotational semantics for Prolog with cut

Theoretical Computer Science - Special issue on the Second French-Soviet Workshop on Methods of Compilation and Program Construction, Nice, France, Feb. 1988
Comparative semantics for PROLOG with cut

Science of Computer Programming
Abstract interpretation and application to logic programs

Journal of Logic Programming
An abstract interpretation framework which accurately handles prolog search-rule and the cut

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Prolog: the standard: reference manual

Prolog: the standard: reference manual
From logic programming to Prolog

From logic programming to Prolog
Static Analysis of Prolog with Cut

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Proving Existential Termination of Normal Logic Programs

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Abstract Interpretation of Prolog Programs

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A Semantics-Based Determinacy Analysis for Prolog with Cut

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
The witness properties and the semantics of the Prolog cut

Theory and Practice of Logic Programming
Efficient groundness analysis in Prolog

Theory and Practice of Logic Programming
On termination of meta-programs

Theory and Practice of Logic Programming
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
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
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
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A dependency pair framework for innermost complexity analysis of term rewrite systems

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Probabilistic termination of CHRiSM programs

LOPSTR'11 Proceedings of the 21st 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
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-free program implies termination of the original program. Hence after this pre-processing, any technique for proving termination of definite logic programs can be applied. We implemented this pre-processing in our termination prover AProVE and evaluated it successfully with extensive experiments.