Loop checks for logic programs with functions
- 6 September 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 266 (1-2) , 441-461
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Tabulated resolution for the well-founded semanticsThe Journal of Logic Programming, 1998
- Automatic finite unfolding using well-founded measuresThe Journal of Logic Programming, 1996
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Mixtus: An automatic partial evaluator for full PrologNew Generation Computing, 1993
- Loop checking in partial deductionThe Journal of Logic Programming, 1993
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- An analysis of loop checking mechanisms for logic programsTheoretical Computer Science, 1991
- 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
- Eliminating unwanted loops in PrologACM SIGPLAN Notices, 1985