DBScholar

Back to papers

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)

Paper ID
1761
Venue
PODS
Year
2018
Pagerank
6.0926349e-05
Overall Rank
5,773 | 60.40%
DOI
10.1145/3196959.3196982

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers