Input-Termination of Logic Programs

DOI10.1007/11506676_14MaRDI QIDQ5458804zbMATHOpenAlexFDO

Authors M. R. K. Krishna Rao

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11506676_14

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination proofs for logic programs
• Program Development in Computational Logic
• Termination of constraint logic programs
• scientific article; zbMATH DE number 1696776
• scientific article; zbMATH DE number 1696796
• Strong termination of logic programs
• scientific article; zbMATH DE number 176506
• Program Development in Computational Logic
• A methodology for proving termination of logic programs

Cited in

(8)

• scientific article; zbMATH DE number 1696796 (Why is no real title available?)
• Termination of constraint logic programs
• Modular termination of \(r\)-consistent and left-linear term rewriting systems
• Strong termination of logic programs
• Inference of Termination Conditions for Numerical Loops in Prolog
• Logic Programming
• Semantics of well-moded input consuming logic programs
• Properties of Input-Consuming Derivations

This page was built for publication: Input-Termination of Logic Programs

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