Termination prediction for general logic programs

DOI10.1017/S1471068409990068MaRDI QIDQ3648357zbMATH OpenFDO

Authors Yi-Dong Shen, Danny De Schreye, Dean Voets

Publication date 25 November 2009

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

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

zbMATH Keywords

logic programmingloop checkingmoded queriestermination analysistermination prediction

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A general framework for automatic termination analysis od logic programs
• Proving termination of general Prolog programs
• A dynamic approach to characterizing termination of general logic programs
• Termination proofs for logic programs
• Termination of logic programs: the never-ending story

Cites work

• A dynamic approach to characterizing termination of general logic programs
• A general criterion for avoiding infinite unfolding during partial deduction
• A general framework for automatic termination analysis od logic programs
• An analysis of loop checking mechanisms for logic programs
• Automatic finite unfolding using well-founded measures
• cTI: a constraint-based termination inference tool for ISO-Prolog
• Efficient loop detection in prolog using the tortoise-and-hare technique
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Inferring termination conditions for logic programs using backwards analysis
• Loop checks for logic programs with functions
• Mixtus: An automatic partial evaluator for full Prolog
• On modular termination proofs of general logic programs
• Reasoning about termination of pure Prolog programs
• Tabled evaluation with delaying for general logic programs
• Termination of logic programs: the never-ending story
• Termination proofs for logic programs with tabling
• Transformational methodology for proving termination of logic programs

Cited in

(9)

• Termination of logic programs with imperfect information: applications and query procedure
• Non-termination Analysis of Logic Programs Using Types
• Non-termination analysis of logic programs with integer arithmetics
• A new approach to non-termination analysis of logic programs
• cTI: a constraint-based termination inference tool for ISO-Prolog
• A dynamic approach to characterizing termination of general logic programs
• A practical analysis of non-termination in large logic programs
• A novel derivation framework for definite logic program
• A general framework for automatic termination analysis od logic programs

Describes a project that uses

Uses Software

• TALP

This page was built for publication: Termination prediction for general logic programs

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