An analysis of loop checking mechanisms for logic programs

DOI10.1016/0304-3975(91)90004-LzbMath0741.68027OpenAlexW2069453418MaRDI QIDQ1177923

Jan Willem Klop, Roland N. Bol, Krzysztof R. Apt

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90004-l

zbMATH Keywords

infinite loops in computations of logic programsloop checks

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (14)

Abduction in logic programming: A new definition and an abductive procedure based on rewriting ⋮ Deciding the Bisimilarity Relation between Datalog Goals ⋮ Explanations as programs in probabilistic logic programming ⋮ Knowledge base dynamics, abduction, and database updates ⋮ A metalogic programming approach: language, semantics and applications ⋮ A practical analysis of non-termination in large logic programs ⋮ Generalizing completeness results for loop checks in logic programming ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Loop checks for logic programs with functions ⋮ A non-termination criterion for binary constraint logic programs ⋮ Detecting non-provable goals ⋮ Termination prediction for general logic programs ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controlling recursive inference
• A note on simplification orderings
• Recursive query processing: The power of logic
• Efficient loop detection in prolog using the tortoise-and-hare technique
• Contributions to the Theory of Logic Programming
• Partial evaluation in logic programming
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

This page was built for publication: An analysis of loop checking mechanisms for logic programs