Inference of termination conditions for numerical loops in Prolog

DOI10.1017/S1471068404002042MaRDI QIDQ4669655zbMATH OpenOpenAlexFDO

Authors Alexander Serebrenik, Danny De Schreye

Publication date 15 April 2005

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068404002042

zbMATH Keywords

logic programsnumerical computationstermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Inference of Termination Conditions for Numerical Loops in Prolog
• scientific article; zbMATH DE number 1948394
• Termination of floating-point computations
• A general framework for automatic termination analysis od logic programs
• scientific article; zbMATH DE number 1834571

Cited in

(7)

• Terminating evaluation of logic programs with finite three-valued models
• Inference of Termination Conditions for Numerical Loops in Prolog
• Inferring termination conditions for logic programs using backwards analysis
• Proving Termination of Integer Term Rewriting
• scientific article; zbMATH DE number 1948394 (Why is no real title available?)
• Inferring termination conditions for logic programs using backwards analysis
• 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 Q4669655)