A further note on looping in Prolog
- 1 August 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 20 (8) , 28-31
- https://doi.org/10.1145/988346.988348
Abstract
In an earlier paper (Covington 1984) I proposed that looping in Prolog should be prevented by blocking all derivations in which the current goal matches a higher goal. This is too strong a constraint; it causes exhaustive searches to be incomplete. A better approach is to block all derivations in which the current goal matches a higher goal and is about to be evaluted using the same rule as was used to evaluate the higher goal. This is sufficient to block looping, and produces otherwise correct behavior, in all of the cases mentioned in the earlier paper.Keywords
This publication has 1 reference indexed in Scilit:
- Eliminating unwanted loops in PrologACM SIGPLAN Notices, 1985