On the Equivalence of Recursive and Nonrecursive Datalog Programs
- 28 February 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (1), 61-78
- https://doi.org/10.1006/jcss.1997.1452
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Fixpoint extensions of first-order logic and datalog-like languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Programming primitives for database languagesPublished by Association for Computing Machinery (ACM) ,1981
- AlternationJournal of the ACM, 1981
- Embedded implicational dependencies and their inference problemPublished by Association for Computing Machinery (ACM) ,1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- On the menbership problem for functional and multivalued dependencies in relational databasesACM Transactions on Database Systems, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979