On the representation and querying of sets of possible worlds
- 1 January 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 78 (1) , 159-187
- https://doi.org/10.1016/0304-3975(51)90007-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Querying logical databasesJournal of Computer and System Sciences, 1986
- A sound and sometimes complete query evaluation algorithm for relational databases with null valuesJournal of the ACM, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Incomplete Information in Relational DatabasesJournal of the ACM, 1984
- Database relations with null valuesJournal of Computer and System Sciences, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- On the Complexity of Testing Implications of Functional and Join DependenciesJournal of the ACM, 1981
- On Databases with Incomplete InformationJournal of the ACM, 1981
- Testing the universal instance assumptionInformation Processing Letters, 1980
- Extending the database relational model to capture more meaningACM Transactions on Database Systems, 1979