{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:55:51Z","timestamp":1756000551120,"version":"3.44.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1814152"],"award-info":[{"award-number":["1814152"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BSF","award":["2017753"],"award-info":[{"award-number":["2017753"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>Deploying possible world semantics and the challenge of computing the certain answers to queries.<\/jats:p>","DOI":"10.1145\/3624717","type":"journal-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T20:40:46Z","timestamp":1707165646000},"page":"74-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases"],"prefix":"10.1145","volume":"67","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[{"name":"Technion-Israel Institute of Technology, Haifa, Israel"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, and IBM Research, Almaden, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139060158"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303983"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00737-5"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.11.016"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1636"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01883-1"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11395"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395119"},{"key":"e_1_2_2_13_1","first-page":"937","article-title":"Consistent answers of aggregatio queries via SAT. In Proceedings of the 38th Intern. Conf. on Data Engineering (ICDE 2022)","volume":"924","author":"Dixit A.A.","year":"2022","unstructured":"Dixit, A.A. and Kolaitis, P.G. Consistent answers of aggregatio queries via SAT. In Proceedings of the 38th Intern. Conf. on Data Engineering (ICDE 2022). IEEE, 2022, 924--937.","journal-title":"IEEE"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"e_1_2_2_15_1","first-page":"71","article-title":"The theory of data dependencies - A survey","volume":"19","author":"Fagin R.","year":"1986","unstructured":"Fagin, R. and Vardi, M.Y. The theory of data dependencies - A survey. In Symposia in Applied Mathematics, 1986, 19--71.","journal-title":"Symposia in Applied Mathematics"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140445"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.013"},{"key":"e_1_2_2_18_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.295124"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/44"},{"key":"e_1_2_2_22_1","first-page":"46","article-title":"Query evaluation in election databases","volume":"32","author":"Kimelfeld B.","year":"2019","unstructured":"Kimelfeld, B., Kolaitis, P.G. and Tibi, M. Query evaluation in election databases. In PODS. ACM, 2019, 32--46.","journal-title":"PODS. ACM"},{"key":"e_1_2_2_23_1","volume-title":"M. Lenzerini and N. Schweikardt (eds). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik","author":"Dagstuhl","year":"2013","unstructured":"Dagstuhl follow-ups. Data Exchange, Integration, and Streams 5. P.G. Kolaitis, M. Lenzerini and N. Schweikardt (eds). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2013; http:\/\/www.dagstuhl.de\/dagpub\/978-3-939897-61-3"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142357"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.018"},{"key":"e_1_2_2_26_1","volume-title":"Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling 20","author":"Konczak K.","year":"2005","unstructured":"Konczak, K. and Lang, J. Voting procedures with incomplete preferences. In Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling 20, 2005."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068334"},{"volume-title":"ICDT (LIPIcs","author":"Libkin L.","key":"e_1_2_2_28_1","unstructured":"Libkin, L. SQL's three-valued logic and certain answers. In ICDT (LIPIcs, Vol. 31). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2015, 94--109."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000320"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100048"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236253"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031527"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.021"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624717","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624717","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:25:31Z","timestamp":1755973531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1145\/3624717"],"URL":"https:\/\/doi.org\/10.1145\/3624717","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"2024-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}