On eliminating loops in Prolog

Authors:
David Poole;Randy Goebel
Affiliations:
University of Waterloo, Waterloo, Ontario, Canada;University of Waterloo, Waterloo, Ontario, Canada
Venue:
ACM SIGPLAN Notices
Year:
1985

Citing 2
Cited 5

Deleting Repeated Goals in the Problem Reduction Format

Journal of the ACM (JACM)
Eliminating unwanted loops in Prolog

ACM SIGPLAN Notices

Functional dependencies in Horn clause queries

ACM Transactions on Database Systems (TODS)
Generating the minimal model in Prolog

ACM SIGPLAN Notices
Loop checks for logic programs with functions

Theoretical Computer Science
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion

Journal of Automated Reasoning
An Abstract Approach to Some Loop Detection Problems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent papers have explained how infinite loops in a Prolog search tree can be avoided by the use of subgoal deletion. We show here that this works only in limited cases, and argue that these cases can be better avoided by slight modifications of the program, rather than by increasing the complexity of all programs with a rule that has very limited applicability.