Termination of logic programs: the never-ending story
- 1 May 1994
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 19-20, 199-260
- https://doi.org/10.1016/0743-1066(94)90027-2
Abstract
No abstract availableKeywords
This publication has 80 references indexed in Scilit:
- Reasoning about Prolog programs: From modes through types to assertionsFormal Aspects of Computing, 1994
- Proving termination properties of prolog programs: A semantic approachThe Journal of Logic Programming, 1992
- An analysis of loop checking mechanisms for logic programsTheoretical Computer Science, 1991
- A practical framework for theabstract interpretation of logic programsThe Journal of Logic Programming, 1991
- Recursive query processing: the power of logicTheoretical Computer Science, 1989
- On the convergence of query evaluationJournal of Computer and System Sciences, 1989
- Inductive assertion method for logic programsTheoretical Computer Science, 1988
- Efficient loop detection in prolog using the tortoise-and-hare techniqueThe Journal of Logic Programming, 1987
- Automating control for logic programsThe Journal of Logic Programming, 1985
- Some global optimizations for a PROLOG compilerThe Journal of Logic Programming, 1985