{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:19Z","timestamp":1763468119823,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448522","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"213-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Access patterns and integrity constraints revisited"],"prefix":"10.1145","author":[{"given":"Vince","family":"B\u00e1r\u00e1ny","sequence":"first","affiliation":[{"name":"University of Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Benedikt","sequence":"additional","affiliation":[{"name":"Oxford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Bourhis","sequence":"additional","affiliation":[{"name":"Oxford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0085-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_24"},{"key":"e_1_3_2_1_3_1","volume-title":"Processing union of conjunctive queries with negation under limited access patterns,\" in EDBT","author":"Nash A.","year":"2004","unstructured":"A. Nash and B. Lud\u00e4scher , \" Processing union of conjunctive queries with negation under limited access patterns,\" in EDBT , 2004 . A. Nash and B. Lud\u00e4scher, \"Processing union of conjunctive queries with negation under limited access patterns,\" in EDBT, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055601"},{"key":"e_1_3_2_1_5_1","volume-title":"ten Cate, and L. Segoufin, \"Guarded negation,\" in ICALP","author":"B\u00e1r\u00e1ny V.","year":"2011","unstructured":"V. B\u00e1r\u00e1ny , B. ten Cate, and L. Segoufin, \"Guarded negation,\" in ICALP , 2011 . V. B\u00e1r\u00e1ny, B. ten Cate, and L. Segoufin, \"Guarded negation,\" in ICALP, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265534"},{"key":"e_1_3_2_1_7_1","volume-title":"Querying the guarded fragment,\" in LICS","author":"B\u00e1r\u00e1ny V.","year":"2010","unstructured":"V. B\u00e1r\u00e1ny , G. Gottlob , and M. Otto , \" Querying the guarded fragment,\" in LICS , 2010 . V. B\u00e1r\u00e1ny, G. Gottlob, and M. Otto, \"Querying the guarded fragment,\" in LICS, 2010."},{"key":"e_1_3_2_1_8_1","volume-title":"Model Theory","author":"Chang C.","year":"1990","unstructured":"C. Chang and H. J. Keisler , Model Theory . Elsevier , 1990 . C. Chang and H. J. Keisler, Model Theory. Elsevier, 1990."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502030.502032"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/2586808"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"e_1_3_2_1_13_1","volume-title":"Data exchange: Semantics and query answering,\" in ICDT","author":"Fagin R.","year":"2003","unstructured":"R. Fagin , P. G. Kolaitis , R. J. Miller , and L. Popa , \" Data exchange: Semantics and query answering,\" in ICDT , 2003 . R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, \"Data exchange: Semantics and query answering,\" in ICDT, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142404"},{"key":"e_1_3_2_1_15_1","volume-title":"Taming the infinite chase: Query answering under expressive relational constraints","author":"Cal\u00ec A.","year":"2012","unstructured":"A. Cal\u00ec , G. Gottlob , and M. Kifer , \" Taming the infinite chase: Query answering under expressive relational constraints ,\" 2012 . full version of KR 2008 paper, to appear. A. Cal\u00ec, G. Gottlob, and M. Kifer, \"Taming the infinite chase: Query answering under expressive relational constraints,\" 2012. full version of KR 2008 paper, to appear."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806913"},{"key":"e_1_3_2_1_17_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu , Foundations of Databases . Addison-Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995."},{"key":"e_1_3_2_1_18_1","volume-title":"ten Cate, \"Rewriting guarded negation queries","author":"B\u00e1r\u00e1ny V.","year":"2012","unstructured":"V. B\u00e1r\u00e1ny , M. Benedikt , and B. ten Cate, \"Rewriting guarded negation queries ,\" 2012 . Submitted , available from the authors. V. B\u00e1r\u00e1ny, M. Benedikt, and B. ten Cate, \"Rewriting guarded negation queries,\" 2012. Submitted, available from the authors."},{"key":"e_1_3_2_1_19_1","first-page":"1328","article-title":"Queries with guarded negation","volume":"5","author":"B\u00e1r\u00e1ny V.","year":"2012","unstructured":"V. B\u00e1r\u00e1ny , B. ten Cate , and M. Otto , \" Queries with guarded negation ,\" in VLDB , vol. 5 , pp. 1328 -- 1339 , 2012 . V. B\u00e1r\u00e1ny, B. ten Cate, and M. Otto, \"Queries with guarded negation,\" in VLDB, vol. 5, pp. 1328--1339, 2012.","journal-title":"VLDB"},{"key":"e_1_3_2_1_20_1","volume-title":"Recursive plans for information gathering,\" in IJCAI","author":"Duschka O. M.","year":"1997","unstructured":"O. M. Duschka and A. Y. Levy , \" Recursive plans for information gathering,\" in IJCAI , 1997 . O. M. Duschka and A. Y. Levy, \"Recursive plans for information gathering,\" in IJCAI, 1997."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.220199"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304210"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.031"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938580"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448522","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":24,"alternative-id":["10.1145\/2448496.2448522","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448522","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}