{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:26Z","timestamp":1753894406535,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,2,22]]},"abstract":"<jats:p>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 propose a simple inflationary fixpoint algorithm for consistent query answering which, for a given database, naively computes a set $\\Delta$ of subsets of facts of the database of size at most k, where k is the size of the query q. The algorithm runs in polynomial time and can be formally defined as: (1) Initialize $\\Delta$ with all sets $S$ of at most $k$ facts such that $S\\models q$. (2) Add any set $S$ of at most k facts to $\\Delta$ if there exists a block $B$ (i.e., a maximal set of facts sharing the same key) such that for every fact $a \\in B$ there is a set $S' \\subseteq S \\cup \\{a\\}$ such that $S'\\in \\Delta$.   For an input database $D$, the algorithm answers &amp;quot;q is certain&amp;quot; iff $\\Delta$ eventually contains the empty set. The algorithm correctly computes certainty when the query q falls in the polynomial time cases of the known dichotomies for self-join-free queries and path queries. For arbitrary Boolean conjunctive queries, the algorithm is an under-approximation: the query is guaranteed to be certain if the algorithm claims so. However, there are polynomial time certain queries (with self-joins) which are not identified as such by the algorithm.<\/jats:p>","DOI":"10.46298\/lmcs-21(1:18)2025","type":"journal-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T18:05:06Z","timestamp":1740247506000},"source":"Crossref","is-referenced-by-count":0,"title":["A Simple Algorithm for Consistent Query Answering under Primary Keys"],"prefix":"10.46298","volume":"Volume 21, Issue 1","author":[{"given":"Diego","family":"Figueira","sequence":"first","affiliation":[]},{"given":"Anantha","family":"Padmanabha","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Segoufin","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Sirangelo","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,2,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/15276\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/15276\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T18:05:06Z","timestamp":1740247506000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/12679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(1:18)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2301.08482v5","asserted-by":"subject"},{"id-type":"arxiv","id":"2301.08482v4","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2301.08482","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2301.08482","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2025,2,21]]},"article-number":"12679"}}