Non-deterministic languages to express deterministic transformations
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 218-229
- https://doi.org/10.1145/298514.298575
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fundamental properties of deterministic and nondeterministic extensions of DatalogTheoretical Computer Science, 1991
- Data functions, datalog and negationPublished by Association for Computing Machinery (ACM) ,1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Relational queries computable in polynomial timeInformation and Control, 1986
- An assumption-based TMSArtificial Intelligence, 1986
- The Implication Problem for Functional and Inclusion Dependencies is UndecidableSIAM Journal on Computing, 1985
- Incomplete Information in Relational DatabasesJournal of the ACM, 1984
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Programming primitives for database languagesPublished by Association for Computing Machinery (ACM) ,1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980