Detecting optimal termination conditions of logic programs

DOI10.1007/3-540-45789-5_35MaRDI QIDQ4411982zbMATH OpenFDO

Authors Fred Mesnard, Étienne Payet, Ulrich Neumerkel

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2477/24770509.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Applying static analysis techniques for inferring termination conditions of logic programs
• Inferring termination conditions for logic programs using backwards analysis
• Inferring termination conditions for logic programs using backwards analysis
• Termination of constraint logic programs
• Logic Programming
• A methodology for proving termination of logic programs
• Termination proofs for logic programs
• Methodology for proving the termination of logic programs
• A dynamic approach to characterizing termination of general logic programs

Cited in

(9)

• Inference of Termination Conditions for Numerical Loops in Prolog
• Inferring termination conditions for logic programs using backwards analysis
• scientific article; zbMATH DE number 516986 (Why is no real title available?)
• Termination of constraint logic programs
• A new approach to non-termination analysis of logic programs
• Inferring termination conditions for logic programs using backwards analysis
• Applying static analysis techniques for inferring termination conditions of logic programs
• A practical analysis of non-termination in large logic programs
• Fifty Years of Prolog and Beyond

This page was built for publication: Detecting optimal termination conditions of logic programs

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