Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms
Summary: Characterizes when CERTAINTY(q) is first-order definable for self-join-free conjunctive queries with negated atoms under primary-key repairs. Shows negation can encode classical matching problems, extending prior CQA classifications and complicating SQL-rewritability. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Paraschos Koutris (University of Wisconsin)
- 2. Jef Wijsen (Université de Mons)
BibTeX Citation
@inproceedings{koutris_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196982},
doi = {10.1145/3196959.3196982},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Koutris, Paraschos and Wijsen, Jef},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049907763 |
| 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.9625097e-05 |
| 2,551 | Efficient Querying of Inconsistent Databases with Binary Integer Programming | 2013 | VLDB | 8.4290374e-05 |
| 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS | 5.7068548e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,133 | First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys | 2020 | PODS |
| 2 | 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS |
| 3 | 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 4 | 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS |
| 5 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |
| 6 | 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 7 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 8 | 5,844 | A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join | 2024 | PODS |
| 9 | 11,524 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys | 2022 | PODS |
| 10 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |