A semantic basis for the termination analysis of logic programs

DOI10.1016/S0743-1066(99)00006-0MaRDI QIDQ4719375zbMATH OpenFDO

Authors Michael Codish, Cohavit Taboch

Publication date 22 November 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(99)00006-0

zbMATH Keywords

binary unfoldings

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1088021
• scientific article; zbMATH DE number 1696776
• Automated Termination Analysis for Logic Programs by Term Rewriting
• A general framework for automatic termination analysis od logic programs
• Termination Analysis of Logic Programs Based on Dependency Graphs
• A methodology for proving termination of logic programs
• A new approach to non-termination analysis of logic programs
• scientific article; zbMATH DE number 1834571
• Inferring termination conditions for logic programs using backwards analysis

Cited in

(25)

• A complexity tradeoff in ranking-function termination proofs
• Fast offline partial evaluation of logic programs
• scientific article; zbMATH DE number 1696593 (Why is no real title available?)
• scientific article; zbMATH DE number 1696776 (Why is no real title available?)
• A hybrid approach to conjunctive partial evaluation of logic programs
• On termination of meta-programs
• Automated termination analysis for logic programs with cut
• Analysis of Linear Hybrid Systems in CLP
• Fast Offline Partial Evaluation of Large Logic Programs
• All-Termination(T)
• A non-termination criterion for binary constraint logic programs
• scientific article; zbMATH DE number 1088021 (Why is no real title available?)
• Proving termination of nonlinear command sequences
• scientific article; zbMATH DE number 1834571 (Why is no real title available?)
• Localized operational termination in general logics
• Correctness and completeness of logic programs
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• Logic Programming
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Non-termination in Term Rewriting and Logic Programming
• A new look at the automatic synthesis of linear ranking functions
• Finite-tree analysis for constraint logic-based languages
• Verifying termination and reduction properties about higher-order logic programs
• Loop detection in term rewriting using the eliminating unfoldings
• Termination of narrowing via termination of rewriting

This page was built for publication: A semantic basis for the termination analysis of logic programs

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