Generalizing completeness results for loop checks in logic programming

DOI10.1016/0304-3975(92)90164-BzbMath0771.68034MaRDI QIDQ1199926

Roland N. Bol

Publication date: 17 January 1993

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

zbMATH Keywords

Loop checkingnormal SLD derivations

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

The role of standardising apart in logic programming ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals

Cites Work

• Controlling recursive inference
• An analysis of loop checking mechanisms for logic programs
• Recursive query processing: The power of logic
• Efficient loop detection in prolog using the tortoise-and-hare technique
• An Efficient Unification Algorithm
• Partial evaluation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalizing completeness results for loop checks in logic programming