Bottom-up evaluation and query optimization of well-founded models
- 1 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 146 (1-2) , 145-184
- https://doi.org/10.1016/0304-3975(94)00153-a
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Tight, consistent, and computable completions for unrestricted logic programsThe Journal of Logic Programming, 1993
- Safe computation of the well-founded semantics of datalog queriesInformation Systems, 1992
- Efficient bottom-up computation of queries on stratified databasesThe Journal of Logic Programming, 1991
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Strict completion of Logic ProgramsNew Generation Computing, 1991
- The expressive power of stratified logic programsInformation and Computation, 1991
- A generalization of the differential approach to recursive query evaluationThe Journal of Logic Programming, 1987
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976