{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:45:16Z","timestamp":1762101916941,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M005852\/1,EP\/L012138\/1"],"award-info":[{"award-number":["EP\/M005852\/1,EP\/L012138\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2935306","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"297-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Querying Visible and Invisible Information"],"prefix":"10.1145","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Bourhis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balder","family":"ten Cate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Puppis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"key":"e_1_3_2_1_2_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_3_1","volume-title":"IJCAI","author":"Baget J.-F.","year":"2009","unstructured":"J.-F. Baget , M. Lecl\u00e8re , M.-L. Mugnier , and E. Salvat . Extending decidable cases for rules with existential variables . In IJCAI , 2009 . J.-F. Baget, M. Lecl\u00e8re, M.-L. Mugnier, and E. Salvat. Extending decidable cases for rules with existential variables. In IJCAI, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283516.2283519"},{"key":"e_1_3_2_1_5_1","volume-title":"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_6_1","volume-title":"VLDB","author":"B\u00e1r\u00e1ny V.","year":"2012","unstructured":"V. B\u00e1r\u00e1ny , B. ten Cate , and M. Otto . Queries with guarded negation . In VLDB , 2012 . V. B\u00e1r\u00e1ny, B. ten Cate, and M. Otto. Queries with guarded negation. In VLDB, 2012."},{"key":"e_1_3_2_1_7_1","volume-title":"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_8_1","volume-title":"ten Cate, and G. Puppis. Query visible and invisible tables in the presence of constraints","author":"Benedikt M.","year":"2015","unstructured":"M. Benedikt , P. Bourhis , B. ten Cate, and G. Puppis. Query visible and invisible tables in the presence of constraints , 2015 . arxiv.org. M. Benedikt, P. Bourhis, B. ten Cate, and G. Puppis. Query visible and invisible tables in the presence of constraints, 2015. arxiv.org."},{"key":"e_1_3_2_1_9_1","volume-title":"ten Cate, and M. V. Boom. The complexity of boundedness for guarded logics","author":"Benedikt M.","year":"2015","unstructured":"M. Benedikt , T. Colcombet , B. ten Cate, and M. V. Boom. The complexity of boundedness for guarded logics , 2015 . M. Benedikt, T. Colcombet, B. ten Cate, and M. V. Boom. The complexity of boundedness for guarded logics, 2015."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591248.2591252"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90075-8"},{"key":"e_1_3_2_1_12_1","volume-title":"North-Holland","author":"Chang C. C.","year":"1990","unstructured":"C. C. Chang and H. J. Keisler . Model Theory . North-Holland , 1990 . C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1990."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376938"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1862919.1862924"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.10.007"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00012-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213582"},{"key":"e_1_3_2_1_20_1","volume-title":"IJCAI","author":"Lutz C.","year":"2013","unstructured":"C. Lutz , I. Seylan , and F. Wolter . Ontology-based data access with closed predicates is inherently intractable(sometimes) . In IJCAI , 2013 . C. Lutz, I. Seylan, and F. Wolter. Ontology-based data access with closed predicates is inherently intractable(sometimes). In IJCAI, 2013."},{"key":"e_1_3_2_1_21_1","volume-title":"IJCAI","author":"Lutz C.","year":"2015","unstructured":"C. Lutz , I. Seylan , and F. Wolter . Ontology-mediated queries with closed predicates . In IJCAI , 2015 . C. Lutz, I. Seylan, and F. Wolter. Ontology-mediated queries with closed predicates. In IJCAI, 2015."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_18"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2935306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":24,"alternative-id":["10.1145\/2933575.2935306","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2935306","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}