{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T23:29:07Z","timestamp":1774913347973,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319235394","type":"print"},{"value":"9783319235400","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23540-0_24","type":"book-chapter","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T11:48:00Z","timestamp":1442317680000},"page":"354-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["First-Order Under-Approximations of Consistent Query Answers"],"prefix":"10.1007","author":[{"given":"Floris","family":"Geerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Pijcke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jef","family":"Wijsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"24_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68\u201379. ACM Press (1999)","DOI":"10.1145\/303976.303983"},{"key":"24_CR3","series-title":"Synthesis Lectures on Data Management","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01883-1","volume-title":"Database Repairing and Consistent Query Answering","author":"LE Bertossi","year":"2011","unstructured":"Bertossi, L.E.: Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2011)"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/TKDE.2012.86","volume":"25","author":"LE Bertossi","year":"2013","unstructured":"Bertossi, L.E., Li, L.: Achieving data privacy through secrecy views and null-based virtual updates. IEEE Trans. Knowl. Data Eng. 25(5), 987\u20131000 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"24_CR5","unstructured":"Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: IJCAI. IJCAI\/AAAI (2013)"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2009.06.009","volume":"202","author":"NV Cao","year":"2010","unstructured":"Cao, N.V., Fragnire, E., Gauthier, J.-A., Sapin, M., Widmer, E.D.: Optimizing the marriage market: an application of the linear assignment model. Eur. J. Oper. Res. 202(2), 547\u2013553 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"24_CR7","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ic.2004.04.007","volume":"197","author":"J Chomicki","year":"2005","unstructured":"Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1\u20132), 90\u2013121 (2005)","journal-title":"Inf. Comput."},{"issue":"7","key":"24_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1538788.1538810","volume":"52","author":"NN Dalvi","year":"2009","unstructured":"Dalvi, N.N., R\u00e9, C., Suciu, D.: Probabilistic databases: diamonds in the dirt. Commun. ACM 52(7), 86\u201394 (2009)","journal-title":"Commun. ACM"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.jcss.2010.04.006","volume":"77","author":"NN Dalvi","year":"2011","unstructured":"Dalvi, N.N., Re, C., Suciu, D.: Queries and materialized views on probabilistic databases. J. Comput. Syst. Sci. 77(3), 473\u2013490 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR10","series-title":"Synthesis Lectures on Data Management","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01892-3","volume-title":"Foundations of Data Quality Management","author":"W Fan","year":"2012","unstructured":"Fan, W., Geerts, F.: Foundations of Data Quality Management. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2012)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-30570-5_23","volume-title":"Database Theory - ICDT 2005","author":"AD Fuxman","year":"2005","unstructured":"Fuxman, A.D., Miller, R.J.: First-order query rewriting for inconsistent databases. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 337\u2013351. Springer, Heidelberg (2005)"},{"key":"24_CR12","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York (1999)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Koutris, P., Wijsen, J.: The data complexity of consistent query answering for self-join-free conjunctive queries under primary key constraints. In: PODS, pp. 17\u201329. ACM (2015)","DOI":"10.1145\/2745754.2745769"},{"key":"24_CR14","unstructured":"Koutris, P., Wijsen, J.: A trichotomy in the data complexity of certain query answering for conjunctive queries. CoRR, abs\/1501.07864 (2015)"},{"key":"24_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, New York (2004)"},{"key":"24_CR16","unstructured":"Libkin, L.: SQL\u2019s three-valued logic and certain answers. In: ICDT. LIPIcs, vol. 31, pp. 94\u2013109. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"issue":"6","key":"24_CR17","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1016\/j.jcss.2013.01.011","volume":"79","author":"D Maslowski","year":"2013","unstructured":"Maslowski, D., Wijsen, J.: A dichotomy in the complexity of counting database repairs. J. Comput. Syst. Sci. 79(6), 958\u2013983 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR18","unstructured":"Maslowski, D., Wijsen, J.: Counting database repairs that satisfy conjunctive queries with self-joins. In: ICDT, pp. 155\u2013164. OpenProceedings.org (2014)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-30204-9_20","volume-title":"Advances in Databases and Information Systems","author":"J Wijsen","year":"2004","unstructured":"Wijsen, J.: Making more out of an inconsistent database. In: Bencz\u00far, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, pp. 291\u2013305. Springer, Heidelberg (2004)"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Wijsen, J.: Charting the tractability frontier of certain conjunctive query answering. In: PODS, pp. 189\u2013200. ACM (2013)","DOI":"10.1145\/2463664.2463666"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-04939-7_2","volume-title":"Foundations of Information and Knowledge Systems","author":"J Wijsen","year":"2014","unstructured":"Wijsen, J.: A survey of the data complexity of consistent query answering under key constraints. In: Beierle, C., Meghini, C. (eds.) FoIKS 2014. LNCS, vol. 8367, pp. 62\u201378. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23540-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:31:22Z","timestamp":1676979082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23540-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235394","9783319235400"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23540-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}