Loop checks for logic programs with functions

DOI10.1016/S0304-3975(00)00197-3zbMath0989.68016OpenAlexW1981314990MaRDI QIDQ5958765

No author found.

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00197-3

zbMATH Keywords

logic programmingloop checking

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

A non-termination criterion for binary constraint logic programs ⋮ Termination prediction for general logic programs

Uses Software

• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controlling recursive inference
• An analysis of loop checking mechanisms for logic programs
• A general criterion for avoiding infinite unfolding during partial deduction
• Recursive query processing: The power of logic
• Mixtus: An automatic partial evaluator for full Prolog
• Redundancy elimination and loop checks for logic programs
• Automatic finite unfolding using well-founded measures
• Efficient loop detection in prolog using the tortoise-and-hare technique
• Tabulated resolution for the well-founded semantics
• Partial evaluation in logic programming
• Termination of logic programs: the never-ending story
• Tabled evaluation with delaying for general logic programs
• Linear tabulated resolution based on Prolog control strategy
• Loop checking in partial deduction

This page was built for publication: Loop checks for logic programs with functions