On the decidability and complexity of query answering over inconsistent and incomplete databases
- 9 June 2003
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 260-271
- https://doi.org/10.1145/773153.773179
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Data integrationPublished by Association for Computing Machinery (ACM) ,2002
- Answering queries using views: A surveyThe VLDB Journal, 2001
- Consistent query answers in inconsistent databasesPublished by Association for Computing Machinery (ACM) ,1999
- MERGING DATABASES UNDER CONSTRAINTSInternational Journal of Cooperative Information Systems, 1998
- The Complexity of Nested Counterfactuals and Iterated Knowledge Base RevisionsJournal of Computer and System Sciences, 1996
- On the complexity of propositional knowledge base revision, updates, and counterfactualsArtificial Intelligence, 1992
- On the logic of theory change: Partial meet contraction and revision functionsThe Journal of Symbolic Logic, 1985
- Testing containment of conjunctive queries under functional and inclusion dependenciesJournal of Computer and System Sciences, 1984
- Inclusion dependencies and their interaction with functional dependenciesJournal of Computer and System Sciences, 1984
- On Closed World Data BasesPublished by Springer Science and Business Media LLC ,1978