Generalizing completeness results for loop checks in logic programming
From MaRDI portal
Recommendations
Cites work
- An analysis of loop checking mechanisms for logic programs
- An Efficient Unification Algorithm
- 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 4057010 (Why is no real title available?)
- scientific article; zbMATH DE number 408774 (Why is no real title available?)
- scientific article; zbMATH DE number 549972 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- Partial evaluation in logic programming
- Recursive query processing: The power of logic
Cited in
(7)- The role of standardising apart in logic programming
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Redundancy elimination and loop checks for logic programs
- Completeness and counter-example generations of a basic protocol logic (extended abstract)
- scientific article; zbMATH DE number 549972 (Why is no real title available?)
- scientific article; zbMATH DE number 813263 (Why is no real title available?)
- Loop checks for logic programs with functions
This page was built for publication: Generalizing completeness results for loop checks in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199926)