Termination Analysis of Logic Programs Based on Dependency Graphs

DOI10.1007/978-3-540-78769-3_2zbMath1179.68040OpenAlexW2111739714MaRDI QIDQ5504590

Manh Thang Nguyen, Peter Schneider-Kamp, Jürgen Giesl, Danny De Schreye

Publication date: 22 January 2009

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-540-78769-3_2

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Automating Termination Proofs for CHR ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Dependency Triples for Improving Termination Analysis of Logic Programs with Cut ⋮ Termination of Narrowing Using Dependency Pairs ⋮ Localized Operational Termination in General Logics

Uses Software

• AProVE
• TPDB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mechanically proving termination using polynomial interpretations
• Mechanizing and improving dependency pairs
• Termination of rewriting
• An analysis of loop checking mechanisms for logic programs
• Termination proofs for logic programs
• Testing positiveness of polynomials
• Norms on terms and their use in proving universal termination of a logic program
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Automating the dependency pair method
• The size-change principle and dependency pairs for termination of term rewriting
• Transition Invariants and Transition Predicate Abstraction for Program Termination
• Automated Termination Analysis for Logic Programs by Term Rewriting
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Matrix Interpretations for Proving Termination of Term Rewriting
• cTI: a constraint-based termination inference tool for ISO-Prolog
• A semantic basis for the termination analysis of logic programs
• The size-change principle for program termination
• Logic Programming
• Logic for Programming, Artificial Intelligence, and Reasoning
• A general framework for automatic termination analysis od logic programs

This page was built for publication: Termination Analysis of Logic Programs Based on Dependency Graphs