A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
Databases
2024-05-27 v2
Abstract
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs of a given inconsistent database) is either polynomial time or coNP-complete. This conjecture has been verified for self-join-free and path queries. We show that it also holds for queries with two atoms.
Keywords
Cite
@article{arxiv.2309.12059,
title = {A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join},
author = {Anantha Padmanabha and Luc Segoufin and Cristina Sirangelo},
journal= {arXiv preprint arXiv:2309.12059},
year = {2024}
}