On eliminating loops in Prolog
David Poole, Randy G. Goebel · ACM SIGPLAN Notices · 1985
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.