{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:31Z","timestamp":1750220431441,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:00:00Z","timestamp":1619740800000},"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":"crossref","award":["EP\/M005852\/1 and EP\/L012138\/1"],"award-info":[{"award-number":["EP\/M005852\/1 and EP\/L012138\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CPER Nord-Pas de Calais\/FEDER DATA"},{"name":"Advanced data science and technologies"},{"name":"ANR Aggreg project","award":["ANR-14-CE25-0017"],"award-info":[{"award-number":["ANR-14-CE25-0017"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2021,4,30]]},"abstract":"<jats:p>\n            We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary is visible to a user\u2014that is, their complete contents are known\u2014while the remaining relations are invisible. We also have a background theory\u2014invariants given by logical sentences\u2014that may relate the visible relations to invisible ones, and also may constrain both the visible and invisible relations in isolation. We want to determine whether some other information, given as a positive existential formula, can be inferred using only the visible information and the background theory. This formula whose inference we are concerned with is denoted as the\n            <jats:italic>query<\/jats:italic>\n            . We consider whether positive information about the query can be inferred, and also whether negative information\u2014the sentence does not hold\u2014can be inferred. We further consider both the instance-level version of the problem, where both the query and the visible instance are given, and the schema-level version, where we want to know whether truth or falsity of the query can be inferred in\n            <jats:italic>some<\/jats:italic>\n            instance of the schema.\n          <\/jats:p>","DOI":"10.1145\/3452919","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T21:33:01Z","timestamp":1624311181000},"page":"1-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Inference from Visible Information and Background Knowledge"],"prefix":"10.1145","volume":"22","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Bourhis","sequence":"additional","affiliation":[{"name":"CNRS, CRIStAL, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balder Ten","family":"Cate","sequence":"additional","affiliation":[{"name":"Google, Mountainvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabrieled","family":"Puppis","sequence":"additional","affiliation":[{"name":"University of Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael Vanden","family":"Boom","sequence":"additional","affiliation":[{"name":"d\u2019Overbroeck\u2019s College, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196965"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1661445.1661553"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of VLDB\u201912","author":"B\u00e1r\u00e1ny Vince","year":"2012","unstructured":"Vince B\u00e1r\u00e1ny , Balder Ten Cate , and Martin Otto . 2012 . Queries with guarded negation . In Proceedings of VLDB\u201912 . Vince B\u00e1r\u00e1ny, Balder Ten Cate, and Martin Otto. 2012. Queries with guarded negation. In Proceedings of VLDB\u201912."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027259"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2701414"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.26"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682563"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3367243.3367254"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/12"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935306"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of ICALP\u201917","author":"Benedikt Michael","year":"2017","unstructured":"Michael Benedikt , Pierre Bourhis , and Michael Vanden Boom . 2017 . Characterizing definability in decidable fixpoint logics . In Proceedings of ICALP\u201917 . Michael Benedikt, Pierre Bourhis, and Michael Vanden Boom. 2017. Characterizing definability in decidable fixpoint logics. In Proceedings of ICALP\u201917."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.36"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298395"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.06.002"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings ofAAAI\u201918","author":"Benedikt Michael","year":"2018","unstructured":"Michael Benedikt , Boris Motik , and Efthymia Tsamoura . 2018 . Goal-driven query answering for existential rules with equality . In Proceedings ofAAAI\u201918 . Michael Benedikt, Boris Motik, and Efthymia Tsamoura. 2018. Goal-driven query answering for existential rules with equality. In Proceedings ofAAAI\u201918."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847523"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847523"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603108"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(53)50042-3"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976736"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591248.2591252"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90075-8"},{"key":"e_1_2_1_25_1","unstructured":"C. C. Chang and H. J. Keisler. 1990. Model Theory. North-Holland.  C. C. Chang and H. J. Keisler. 1990. Model Theory. North-Holland."},{"key":"e_1_2_1_26_1","unstructured":"R. Chirkova and T. Yu. 2014. Obtaining information about queries behind views and dependencies. arXiv:1403.5199  R. Chirkova and T. Yu. 2014. Obtaining information about queries behind views and dependencies. arXiv:1403.5199"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376938"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1085304.1085309"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807109"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1862919.1862924"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.10.007"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_25"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.35"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00012-9"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2566972.2566991"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2733003"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.07.004"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213582"},{"volume-title":"Proceedings of the 2012 International Workshop on Description Logics. http:\/\/ceur-ws.org\/Vol-846\/paper_17","author":"Lutz C.","key":"e_1_2_1_39_1","unstructured":"C. Lutz , I. Seylan , and F. Wolter . 2012. Mixing open and closed world assumption in ontology-based data access: Non-uniform data complexity . In Proceedings of the 2012 International Workshop on Description Logics. http:\/\/ceur-ws.org\/Vol-846\/paper_17 .pdf. C. Lutz, I. Seylan, and F. Wolter. 2012. Mixing open and closed world assumption in ontology-based data access: Non-uniform data complexity. In Proceedings of the 2012 International Workshop on Description Logics. http:\/\/ceur-ws.org\/Vol-846\/paper_17.pdf."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2540128.2540276"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832581.2832684"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_7"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804694"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.004"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11965893_7"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806913"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/3032027.3032056"},{"key":"e_1_2_1_48_1","unstructured":"Adrian Onet. 2013. The chase procedure and its applications in data exchange. In Data Exchange Intregation and Streams. Schloss Dagstuhl 1\u201337.  Adrian Onet. 2013. The chase procedure and its applications in data exchange. In Data Exchange Intregation and Streams. Schloss Dagstuhl 1\u201337."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90040-N"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.685998"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_18"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:06Z","timestamp":1750193226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,30]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,30]]}},"alternative-id":["10.1145\/3452919"],"URL":"https:\/\/doi.org\/10.1145\/3452919","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2021,4,30]]},"assertion":[{"value":"2019-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}