A semantic basis for the termination analysis of logic programs
From MaRDI portal
Publication:4719375
DOI10.1016/S0743-1066(99)00006-0zbMath0948.68114MaRDI QIDQ4719375
Michael Codish, Cohavit Taboch
Publication date: 22 November 2000
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (17)
Correctness and Completeness of Logic Programs ⋮ Verifying termination and reduction properties about higher-order logic programs ⋮ Fast offline partial evaluation of logic programs ⋮ Proving termination of nonlinear command sequences ⋮ A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Termination of narrowing via termination of rewriting ⋮ A new look at the automatic synthesis of linear ranking functions ⋮ Analysis of Linear Hybrid Systems in CLP ⋮ Fast Offline Partial Evaluation of Large Logic Programs ⋮ All-Termination(T) ⋮ A SAT-Based Approach to Size Change Termination with Global Ranking Functions ⋮ A non-termination criterion for binary constraint logic programs ⋮ A complexity tradeoff in ranking-function termination proofs ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ Localized Operational Termination in General Logics ⋮ Finite-tree analysis for constraint logic-based languages
This page was built for publication: A semantic basis for the termination analysis of logic programs
