Incomplete Information in Relational Databases
Journal of the ACM (JACM)
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
A deductive solution for plan generation
New Generation Computing
Theoretical Computer Science
On the representation and querying of sets of possible worlds
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Horn tables-an efficient tool for handling incomplete information in databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indefinite and maybe information in relational databases
ACM Transactions on Database Systems (TODS)
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Artificial intelligence and mathematical theory of computation
Semantic representations and query languages for or-sets
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating plans in linear logic I: actions as proofs
Theoretical Computer Science
Logical approaches to incomplete information: a survey
Logics for databases and information systems
Linear logic for deductive databases
New Generation Computing
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
A Generalized Relational Model for Indefinite and Maybe Information
IEEE Transactions on Knowledge and Data Engineering
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
ULDBs: databases with uncertainty and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
GRN model of probabilistic databases: construction, transition and querying
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
| Hi-index | 0.00 |
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a new semantics for uncertain databases which takes a logical approach by translating uncertain databases into logical theories. A characteristic feature of our semantics is that it uses linear logic, instead of propositional logic, as its logical foundation. Linear logic lends itself well to a logical interpretation of uncertain information because unlike propositional logic, it treats logical formulae not as persistent facts but as consumable resources. We motivate our development by arguing that propositional logic is inadequate as a logical foundation for uncertain databases. As the main result, we show that our semantics is faithful to the operational account of uncertain databases in the algebraic approach.