scientific article; zbMATH DE number 176506

zbMATH Open0773.68018MaRDI QIDQ4035671FDOQ4035671

Authors: Bal Wang, R. K. Shyamasundar 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

universal termination\(U\)-graphsordered assertions

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (14)

• Reasoning about termination of pure Prolog programs
• A methodology for proving termination of logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning in Dynamic Logic about Program Termination
• Termination of logic programs: Transformational methods revisited
• Transformational methodology for proving termination of logic programs
• Norms on terms and their use in proving universal termination of a logic program
• Proving termination of general Prolog programs
• Title not available (Why is that?)
• Strong termination of logic programs
• Termination of logic programs: the never-ending story
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• 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)