Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
Indefinite and maybe information in relational databases
ACM Transactions on Database Systems (TODS)
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Towards a relational model for exclusively disjunctive information
CSC '93 Proceedings of the 1993 ACM conference on Computer science
A Generalized Relational Model for Indefinite and Maybe Information
IEEE Transactions on Knowledge and Data Engineering
Using Constraints for Efficient Query Processing in Nondeterministic Databases
IEEE Transactions on Knowledge and Data Engineering
An Exploration of Relationships Among Exclusive Disjunctive Data
IEEE Transactions on Knowledge and Data Engineering
A Possible World Semantics for Disjunctive Databases
IEEE Transactions on Knowledge and Data Engineering
On Representing Indefinite and Maybe Information in Relational Databases
Proceedings of the Fourth International Conference on Data Engineering
On Representing Indefinite and Maybe Information in Relational Databases: A Generalization
Proceedings of the Sixth International Conference on Data Engineering
Relational Databases with Exclusive Disjunctions
Proceedings of the Eighth International Conference on Data Engineering
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Explicit and default negation in databases and logic programs
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
| Hi-index | 0.00 |
Ever since the emergence of the relational database model, the problem of incompleteness has been studied extensively. Declarative semantics for disjunctive databases widely adopt two methodologies representing opposite ends of the spectrum - Minker's GCWA interprets disjunctions exclusively while Ross and Topor's DDR interprets them inclusively. We argue that the use of either one as the semantics is limiting. For example, in a blood group relation, saying that the blood group of John is A or B, BG(John,A) ∨ BG(John,B) can be interpreted exclusively while the statement supplier S1 supplies part P1 or P2 to project J1, supplies(S1, P1, J1) ∨ supplies(S1, P2, J1) need not necessarily be exclusive. In this paper, we present a model that allows the nature of the disjunctions to be represented explicitly and show its relation to other semantics for disjunctive databases. A notable feature of this extension is that it does not require variables in order to represent indefinite information.