scientific article; zbMATH DE number 176506

MaRDI QIDQ4035671zbMATH OpenFDO

Authors Bal Wang, R. K. Shyamasundar

Publication date 18 May 1993

zbMATH Keywords

universal termination\(U\)-graphsordered assertions

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A methodology for proving termination of logic programs
• Transformational methodology for proving termination of logic programs
• scientific article; zbMATH DE number 879005
• scientific article; zbMATH DE number 1149425
• scientific article; zbMATH DE number 408800

Cited in

(14)

• scientific article; zbMATH DE number 1948416 (Why is no real title available?)
• Reasoning about termination of pure Prolog programs
• Termination of logic programs: the never-ending story
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• Strong termination of logic programs
• Norms on terms and their use in proving universal termination of a logic program
• Transformational methodology for proving termination of logic programs
• Reasoning in Dynamic Logic about Program Termination
• scientific article; zbMATH DE number 6606377 (Why is no real title available?)
• Termination of logic programs: Transformational methods revisited
• scientific article; zbMATH DE number 1149425 (Why is no real title available?)
• A methodology for proving termination of logic programs
• Proving termination of general Prolog programs
• Input-Termination of Logic Programs

This page was built for publication:

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