Efficient top-down computation of queries under the well-founded semantics
- 30 September 1995
- journal article
- Published by Elsevier BV in The Journal of Logic Programming
- Vol. 24 (3), 161-199
- https://doi.org/10.1016/0743-1066(94)00028-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A goal-oriented approach to computing the well-founded semanticsThe Journal of Logic Programming, 1993
- A procedural semantics for well-founded negation in logic programsThe Journal of Logic Programming, 1992
- A simple fixed point characterization of three-valued stable model semanticsInformation Processing Letters, 1991
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Well-Founded Semantics Coincides with Three-Valued Stable Semantics1Fundamenta Informaticae, 1990