A goal-oriented approach to computing the well-founded semantics
- 30 November 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 17 (2-4) , 279-300
- https://doi.org/10.1016/0743-1066(93)90034-e
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A procedural semantics for well-founded negation in logic programsThe Journal of Logic Programming, 1992
- Efficient bottom-up computation of queries on stratified databasesThe Journal of Logic Programming, 1991
- Magic templates: a spellbinding approach to logic programsThe Journal of Logic Programming, 1991
- An analysis of loop checking mechanisms for logic programsTheoretical Computer Science, 1991
- On the declarative and procedural semantics of logic programsJournal of Automated Reasoning, 1989
- A procedural semantics for well founded negation in logic programsPublished by Association for Computing Machinery (ACM) ,1989
- Every logic program has a natural stratification and an iterated least fixed point modelPublished by Association for Computing Machinery (ACM) ,1989
- On the power of Alexander templatesPublished by Association for Computing Machinery (ACM) ,1989
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- OLD resolution with tabulationPublished by Springer Nature ,1986