Dependency triples for improving termination analysis of logic programs with cut

DOI10.1007/978-3-642-20551-4_12MaRDI QIDQ3003493zbMATH OpenOpenAlexFDO

Authors Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl

Publication date 27 May 2011

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20551-4_12

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• The dependency triple framework for termination of logic programs
• Automated termination analysis for logic programs with cut
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Automated termination proofs for logic programs by term rewriting
• Termination Analysis of Logic Programs Based on Dependency Graphs

Cites work

• Automated termination analysis for logic programs with cut
• Automated termination proofs for logic programs by term rewriting
• Automating the dependency pair method
• Efficient groundness analysis in Prolog
• scientific article; zbMATH DE number 867332 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Logic Programming
• Mechanizing and improving dependency pairs
• On proving the termination of algorithms by machine
• On termination of meta-programs
• Polytool: polynomial interpretations as a basis for termination analysis of logic programs
• Recurrence with affine level mappings is P-time decidable for CLP
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination of logic programs: the never-ending story
• Termination of nested and mutually recursive algorithms
• Termination of term rewriting using dependency pairs
• The dependency triple framework for termination of logic programs

Cited in

(4)

• Analyzing program termination and complexity automatically with \textsf{AProVE}
• The dependency triple framework for termination of logic programs
• Automated termination analysis for logic programs with cut
• Checking termination of bottom-up evaluation of logic programs with function symbols

Describes a project that uses

Uses Software

• TPDB

This page was built for publication: Dependency triples for improving termination analysis of logic programs with cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003493)