Transformational methodology for proving termination of logic programs

DOI10.1016/S0743-1066(97)00028-9MaRDI QIDQ3841095zbMATH OpenFDO

Authors M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar

Publication date 5 November 1998

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

Full work available at URL https://doi.org/10.1016/S0743-1066(97)00028-9

zbMATH Keywords

logic programsterm rewriting systems

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 408800
• Termination of logic programs: Transformational methods revisited
• A methodology for proving termination of logic programs
• scientific article; zbMATH DE number 176506
• Termination proofs for logic programs
• Methods for proving termination of rewriting-based programming languages by transformation
• scientific article; zbMATH DE number 1149425
• Automated termination proofs for logic programs by term rewriting
• Automatic Correctness Proofs for Logic Program Transformations

Cited in

(19)

• A framework for incremental learning of logic programs
• Use of logical models for proving infeasibility in term rewriting
• Methods for proving termination of rewriting-based programming languages by transformation
• Automated termination proofs for logic programs by term rewriting
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Termination prediction for general logic programs
• Proving termination properties of prolog programs: A semantic approach
• scientific article; zbMATH DE number 176506 (Why is no real title available?)
• scientific article; zbMATH DE number 408800 (Why is no real title available?)
• A methodology for proving termination of logic programs
• scientific article; zbMATH DE number 1149425 (Why is no real title available?)
• Termination of logic programs with delay declarations
• scientific article; zbMATH DE number 785053 (Why is no real title available?)
• A Transformational Approach to Prove Outermost Termination Automatically
• Program Development in Computational Logic
• Combining termination proofs in model transformation systems
• Termination proofs of well-moded logic programs via conditional rewrite systems
• Termination of logic programs: Transformational methods revisited
• A general proof rule for procedures in predicate transformer semantics

Describes a project that uses

Uses Software

• RRL

This page was built for publication: Transformational 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 Q3841095)