Integrity = validity + completeness
ACM Transactions on Database Systems (TODS)
Logic programs with classical negation
Logic programming
Sound and efficient closed-world reasoning for planning
Artificial Intelligence
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Reasoning Using the Local Closed-World Assumption
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
On the local closed-world assumption of data-sources
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
A three-valued semantics for querying and repairing inconsistent databases
Annals of Mathematics and Artificial Intelligence
Approximate query answering in locally closed databases
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Querying and repairing inconsistent databases under three-valued semantics
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Towards a logical reconstruction of a theory for locally closed databases
ACM Transactions on Database Systems (TODS)
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The Local Closed-World Assumption (LCWA) is a generalization of Reiter's Closed-World Assumption (CWA) for relational databases that may be incomplete. Two basic questions that are related to this assumption are: (1) how to represent the fact that only part of the information is known to be complete, and (2) how to properly reason with this information, that is: how to determine whether an answer to a database query is complete even though the database information is incomplete. In this paper we concentrate on the second issue based on a treatment of the first issue developed in earlier work of the authors. For this we consider a fixpoint semantics for declarative theories that represent locally complete databases. This semantics is based on 3-valued interpretations that allow to distinguish between the certain and possible consequences of the database's theory.