A methodology for proving termination of logic programs

DOI10.1016/0743-1066(94)90004-3zbMATH Open0811.68069OpenAlexW2041937391WikidataQ127124396 ScholiaQ127124396MaRDI QIDQ4306397

Could not fetch data.

Publication date: 19 September 1994

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

Full work available at URL: https://doi.org/10.1016/0743-1066(94)90004-3

zbMATH Keywords

\(U\)-graphsuniversal termination of logic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (16)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Termination of logic programs: the never-ending story ⋮ Proving termination of general Prolog programs ⋮ Strong termination of logic programs ⋮ Proving Termination Using Recursive Path Orders and SAT Solving ⋮ Transformational methodology for proving termination of logic programs ⋮ Automated termination analysis for logic programs with cut ⋮ Reasoning in Dynamic Logic about Program Termination ⋮ A context-based approach to proving termination of evaluation ⋮ Input-Termination of Logic Programs ⋮ A proof-theoretic study of abstract termination principles ⋮ A semantic basis for the termination analysis of logic programs ⋮ A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4 ⋮ Reasoning about termination of pure Prolog programs ⋮ A dynamic approach to characterizing termination of general logic programs

This page was built for publication: A methodology for proving termination of logic programs

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