Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

DOI10.1007/978-3-642-20551-4_12zbMath1326.68063OpenAlexW2123968982MaRDI QIDQ3003493

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

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)

Related Items

Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols

Uses Software

• TPDB

Cites Work

• Unnamed Item
• Mechanizing and improving dependency pairs
• On proving the termination of algorithms by machine
• Termination of nested and mutually recursive algorithms
• Termination of term rewriting using dependency pairs
• Automating the dependency pair method
• Automated termination proofs for logic programs by term rewriting
• Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
• On termination of meta-programs
• The Dependency Triple Framework for Termination of Logic Programs
• Automated termination analysis for logic programs with cut
• Termination of logic programs: the never-ending story
• Efficient groundness analysis in Prolog
• Recurrence with affine level mappings is P-time decidable for CLP
• Logic Programming
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Logic for Programming, Artificial Intelligence, and Reasoning