Summary: Semiring semantics with limited negation for annotated data; consistent answers are the minimum over repairs. Self-join free CQs with keys: CQA is rewritable iff the attack graph is acyclic; extends Koutris-Wijsen to semirings; bag semiring NP-hard and hard to approximate under strong cycles.
(summarized by gpt-5-nano on Feb 09 2026)
@inproceedings{kolaitis_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Rewriting Consistent Answers on Annotated Data}},
url = {https://dl.acm.org/doi/10.1145/3725247},
doi = {10.1145/3725247},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kolaitis, Phokion and Pardal, Nina and Virtema, Jonni and Wijsen, Jef},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
PreviousPage 1 / 1Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.