Termination Analysis of Logic Programs Based on Dependency Graphs

DOI10.1007/978-3-540-78769-3_2MaRDI QIDQ5504590zbMATH OpenOpenAlexFDO

Authors Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, 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)

Recommendations

• The dependency triple framework for termination of logic programs
• A general framework for automatic termination analysis od logic programs
• Logic Programming
• On modular termination proofs of general logic programs
• scientific article; zbMATH DE number 970705

Cites work

• A general framework for automatic termination analysis od logic programs
• A semantic basis for the termination analysis of logic programs
• An analysis of loop checking mechanisms for logic programs
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Automating the dependency pair method
• cTI: a constraint-based termination inference tool for ISO-Prolog
• scientific article; zbMATH DE number 1487842 (Why is no real title available?)
• scientific article; zbMATH DE number 1926607 (Why is no real title available?)
• scientific article; zbMATH DE number 970705 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Logic Programming
• Matrix Interpretations for Proving Termination of Term Rewriting
• Mechanically proving termination using polynomial interpretations
• Mechanizing and improving dependency pairs
• Modular termination proofs for rewriting using dependency pairs
• Norms on terms and their use in proving universal termination of a logic program
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Termination of rewriting
• Termination of term rewriting using dependency pairs
• Termination proofs for logic programs
• Testing positiveness of polynomials
• The size-change principle and dependency pairs for termination of term rewriting
• The size-change principle for program termination
• Transition invariants and transition predicate abstraction for program termination

Cited in

(12)

• Terminating evaluation of logic programs with finite three-valued models
• Dependency triples for improving termination analysis of logic programs with cut
• 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
• Using linear constraints for logic program termination analysis
• A semantic basis for the termination analysis of logic programs
• Localized operational termination in general logics
• Automating Termination Proofs for CHR
• Logic Programming
• Termination of Narrowing Using Dependency Pairs
• A general framework for automatic termination analysis od logic programs

Describes a project that uses

Uses Software

• TPDB
• AProVE

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

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