Loop checks for logic programs with functions
From MaRDI portal
Recommendations
Cites work
- A general criterion for avoiding infinite unfolding during partial deduction
- An analysis of loop checking mechanisms for logic programs
- Automatic finite unfolding using well-founded measures
- Controlling recursive inference
- Efficient loop detection in prolog using the tortoise-and-hare technique
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3982556 (Why is no real title available?)
- scientific article; zbMATH DE number 1098500 (Why is no real title available?)
- scientific article; zbMATH DE number 970704 (Why is no real title available?)
- Linear tabulated resolution based on Prolog control strategy
- Loop checking in partial deduction
- Mixtus: An automatic partial evaluator for full Prolog
- Partial evaluation in logic programming
- Recursive query processing: The power of logic
- Redundancy elimination and loop checks for logic programs
- Tabled evaluation with delaying for general logic programs
- Tabulated resolution for the well-founded semantics
- Termination of logic programs: the never-ending story
Cited in
(5)- An analysis of loop checking mechanisms for logic programs
- Generalizing completeness results for loop checks in logic programming
- A non-termination criterion for binary constraint logic programs
- Termination prediction for general logic programs
- scientific article; zbMATH DE number 813263 (Why is no real title available?)
This page was built for publication: Loop checks for logic programs with functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958765)