Loop checking in SLD-derivations by well-quasi-ordering of goals

DOI10.1016/S0304-3975(98)00167-4zbMath0944.68013WikidataQ127872537 ScholiaQ127872537MaRDI QIDQ1575249

Giuliano Pacini, Maria I. Sessa

Publication date: 21 August 2000

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

zbMATH Keywords

terminationlogic programmingwell-quasi-orderingloop checking

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• An analysis of loop checking mechanisms for logic programs
• Generalizing completeness results for loop checks in logic programming
• Recursive query processing: The power of logic
• Reasoning about termination of pure Prolog programs
• Norms on terms and their use in proving universal termination of a logic program
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• Redundancy elimination and loop checks for logic programs
• On termination of general logic programs w.R.T. constructive negation
• On the power of magic
• Efficient loop detection in prolog using the tortoise-and-hare technique
• Deleting Repeated Goals in the Problem Reduction Format
• Magic templates: a spellbinding approach to logic programs
• Partial evaluation in logic programming
• Strong termination of logic programs
• Resolution Strategies as Decision Procedures
• Magic sets with full sharing
• Loop checking in partial deduction
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Loop checking in SLD-derivations by well-quasi-ordering of goals