A methodology for proving termination of logic programs

DOI10.1016/0743-1066(94)90004-3MaRDI QIDQ4306397zbMATH OpenOpenAlexWikidataFDO

Authors Bal Wang, R. K. Shyamasundar

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

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

Recommendations

• scientific article; zbMATH DE number 176506
• A general framework for automatic termination analysis od logic programs
• Transformational methodology for proving termination of logic programs
• scientific article; zbMATH DE number 879005
• scientific article; zbMATH DE number 1149425

Cited in

(20)

• Reasoning about termination of pure Prolog programs
• Program Development in Computational Logic
• scientific article; zbMATH DE number 1948416 (Why is no real title available?)
• A dynamic approach to characterizing termination of general logic programs
• scientific article; zbMATH DE number 176506 (Why is no real title available?)
• scientific article; zbMATH DE number 1149425 (Why is no real title available?)
• Reasoning in Dynamic Logic about Program Termination
• Termination of logic programs: Transformational methods revisited
• A semantic basis for the termination analysis of logic programs
• A proof-theoretic study of abstract termination principles
• Transformational methodology for proving termination of logic programs
• A context-based approach to proving termination of evaluation
• Automated termination analysis for logic programs with cut
• Proving termination of general Prolog programs
• scientific article; zbMATH DE number 6606377 (Why is no real title available?)
• Strong termination of logic programs
• A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
• Termination of logic programs: the never-ending story
• Input-Termination of Logic Programs
• Proving Termination Using Recursive Path Orders and SAT Solving

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)