Automatic finite unfolding using well-founded measures
- 31 August 1996
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 28 (2) , 89-146
- https://doi.org/10.1016/0743-1066(95)00149-2
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Mixtus: An automatic partial evaluator for full PrologNew Generation Computing, 1993
- The loop absorption and the generalization strategies for the development of logic programs and partial deductionThe Journal of Logic Programming, 1993
- Loop checking in partial deductionThe Journal of Logic Programming, 1993
- Guest Editor's IntroductionThe Journal of Logic Programming, 1993
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- An analysis of loop checking mechanisms for logic programsTheoretical Computer Science, 1991
- Metainterpreters for expert system constructionThe Journal of Logic Programming, 1989
- Compiling controlThe Journal of Logic Programming, 1989