Termination of logic programs: the never-ending story

DOI10.1016/0743-1066(94)90027-2zbMath0820.68029OpenAlexW2009286786WikidataQ126839029 ScholiaQ126839029MaRDI QIDQ4305628

Danny De Schreye, Stefaan Decorte

Publication date: 13 October 1994

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/125412

zbMATH Keywords

logic programsLP languagestermination analysis techniques

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (23)

Termination of floating-point computations ⋮ Some techniques for proving termination of the hyperresolution calculus ⋮ Proving Termination by Invariance Relations ⋮ Termination of constraint logic programs ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Verification of logic programs with delay declarations ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Precise complexity guarantees for pointer analysis via Datalog with extensions ⋮ Non-termination Analysis of Logic Programs Using Types ⋮ Dependency Triples for Improving Termination Analysis of Logic Programs with Cut ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Termination of narrowing via termination of rewriting ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ \(\exists\)-Universal termination of logic programs ⋮ Termination Graphs for Java Bytecode ⋮ Loop checks for logic programs with functions ⋮ Non-termination analysis of logic programs with integer arithmetics ⋮ Termination prediction for general logic programs ⋮ Computable Functions in ASP: Theory and Implementation ⋮ Termination Analysis of CHR Revisited ⋮ Localized Operational Termination in General Logics ⋮ Termination analysis for partial functions

This page was built for publication: Termination of logic programs: the never-ending story