Inference of Termination Conditions for Numerical Loops in Prolog

DOI10.1007/3-540-45653-8_45MaRDI QIDQ2996199zbMATH OpenOpenAlexFDO

Authors Alexander Serebrenik, Danny De Schreye

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/133985

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Inference of termination conditions for numerical loops in Prolog
• scientific article; zbMATH DE number 4182856
• Reasoning about termination of pure Prolog programs
• scientific article; zbMATH DE number 3924108
• Proving termination of general Prolog programs
• scientific article; zbMATH DE number 1948416
• scientific article; zbMATH DE number 4176501
• Proving termination properties of prolog programs: A semantic approach
• Termination proofs for logic programs
• Input-Termination of Logic Programs

Cited in

(5)

• Non-termination analysis of logic programs with integer arithmetics
• scientific article; zbMATH DE number 1948394 (Why is no real title available?)
• Inference of termination conditions for numerical loops in Prolog
• Robust non-termination analysis of numerical software
• Termination of floating-point computations

This page was built for publication: Inference of Termination Conditions for Numerical Loops in Prolog

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