Termination prediction for general logic programs

DOI10.1017/S1471068409990068zbMath1184.68162MaRDI QIDQ3648357

Danny De Schreye, Dean Voets, Yi-Dong Shen

Publication date: 25 November 2009

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

zbMATH Keywords

logic programmingloop checkingtermination analysismoded queriestermination prediction

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Non-termination Analysis of Logic Programs Using Types ⋮ A New Approach to Non-termination Analysis of Logic Programs ⋮ Non-termination analysis of logic programs with integer arithmetics

Uses Software

• TALP

Cites Work

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

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