The generalized counting method for recursive logic queries
- 1 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 62 (1-2), 187-220
- https://doi.org/10.1016/0304-3975(86)90015-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Magic counting methodsACM SIGMOD Record, 1987
- A problem-oriented inferential database systemACM Transactions on Database Systems, 1986
- Evaluation of database recursive logic programs as recurrent function seriesACM SIGMOD Record, 1986
- An amateur's introduction to recursive query processing strategiesACM SIGMOD Record, 1986
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- On the implementation of a simple class of logic queries for databasesPublished by Association for Computing Machinery (ACM) ,1985
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Horn clauses and the fixpoint query hierarchyPublished by Association for Computing Machinery (ACM) ,1982
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955