A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- 1 August 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 116 (1) , 117-149
- https://doi.org/10.1016/0304-3975(93)90222-f
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Relational specifications of infinite query answersACM SIGMOD Record, 1989
- On the relationship of congruence closureand unificationJournal of Symbolic Computation, 1989
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- ON SAFETY, DOMAIN INDEPENDENCE, AND CAPTURABILITY OF DATABASE QUERIES* (Preliminary Report)*Research sponsored in part by the NSF grant DCR-8603676.Published by Elsevier ,1988
- Relational queries computable in polynomial timeInformation and Control, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- An efficient decision procedure for the theory of rational orderTheoretical Computer Science, 1977
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- General recursive functions of natural numbersMathematische Annalen, 1936