On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases
Summary: Characterizes decidability and complexity of consistent query answering under key and inclusion dependencies for soundness/completeness variants, proving general undecidability. Identifies a maximal class of inclusion dependencies that with keys yields decidable query answering, with direct implications for data integration. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Andrea Calì (Sapienza University)
- 2. Domenico Lembo (Sapienza University)
- 3. Riccardo Rosati (Sapienza University)
BibTeX Citation
@inproceedings{cali_pods03,
address = {New York, NY, USA},
series = {{PODS} '03},
title = {{On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases}},
url = {https://dl.acm.org/doi/10.1145/773153.773179},
doi = {10.1145/773153.773179},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Calì, Andrea and Lembo, Domenico and Rosati, Riccardo},
year = {2003}
}
Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 22 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00056204792 |
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049907763 |
| 134 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00030343737 |
| 162 | Inclusion dependencies and their interaction with functional dependencies (Extended abstract) | 1982 | PODS | 0.00027886326 |
| 602 | On the Semantics of Updates in Databases | 1983 | PODS | 0.00015856828 |
| 2,506 | On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals | 1992 | PODS | 8.4897076e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,671 | On The Integrity Of Databases With Incomplete Information | 1986 | PODS |
| 2 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 3 | 5,773 | Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms | 2018 | PODS |
| 4 | 8,506 | Checking Consistency of Database Constraints: a Logical Basis | 1986 | VLDB |
| 5 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 6 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |
| 7 | 12,404 | Completeness of Queries over Incomplete Databases | 2011 | VLDB |
| 8 | 2,117 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB |
| 9 | 3,433 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS |
| 10 | 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS |