An analysis of loop checking mechanisms for logic programs
- 19 August 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (1), 35-79
- https://doi.org/10.1016/0304-3975(91)90004-l
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Recursive query processing: the power of logicTheoretical Computer Science, 1989
- Efficient loop detection in prolog using the tortoise-and-hare techniqueThe Journal of Logic Programming, 1987
- A Complete Class of Restricted Logic ProgramsPublished by Elsevier ,1987
- Controlling recursive inferenceArtificial Intelligence, 1986
- On eliminating loops in PrologACM SIGPLAN Notices, 1985
- Eliminating unwanted loops in PrologACM SIGPLAN Notices, 1985
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- A note on simplification orderingsInformation Processing Letters, 1979
- Negation as FailurePublished by Springer Nature ,1978
- Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjectureTransactions of the American Mathematical Society, 1960