{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:37Z","timestamp":1763468197138,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-1217869"],"award-info":[{"award-number":["IIS-1217869"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/H017690\/1"],"award-info":[{"award-number":["EP\/H017690\/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":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603108","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Effective interpolation and preservation in guarded logics"],"prefix":"10.1145","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[{"name":"University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balder","family":"ten Cate","sequence":"additional","affiliation":[{"name":"LogicBlox and UC Santa Cruz"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael Vanden","family":"Boom","sequence":"additional","affiliation":[{"name":"University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_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_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004275029985"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/772062.772068"},{"key":"e_1_3_2_1_4_1","volume-title":"The description logic handbook","author":"Baader F.","year":"2003","unstructured":"F. Baader , D. Calvanese , D. L. McGuinness , D. Nardi , and P. F. Patel-Schneider , editors . The description logic handbook . Cambridge , 2003 . F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The description logic handbook. Cambridge, 2003."},{"key":"e_1_3_2_1_5_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_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448522"},{"key":"e_1_3_2_1_7_1","volume-title":"MFCS","author":"B\u00e1r\u00e1ny V.","year":"2013","unstructured":"V. B\u00e1r\u00e1ny , M. Benedikt , and B. ten Cate . Rewriting guarded negation queries . In MFCS , 2013 . V. B\u00e1r\u00e1ny, M. Benedikt, and B. ten Cate. Rewriting guarded negation queries. In MFCS, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2963594"},{"key":"e_1_3_2_1_9_1","volume-title":"ICALP.","author":"Dawar A.","year":"2007","unstructured":"A. Dawar , M. Grohe , S. Kreutzer , and N. Schweikardt . Model theory makes formulas large . In ICALP. 2007 . A. Dawar, M. Grohe, S. Kreutzer, and N. Schweikardt. Model theory makes formulas large. In ICALP. 2007."},{"key":"e_1_3_2_1_10_1","volume-title":"First-order logic and automated reasoning","author":"Fitting M.","year":"1996","unstructured":"M. Fitting . First-order logic and automated reasoning . Springer , 1996 . M. Fitting. First-order logic and automated reasoning. Springer, 1996."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(76)90167-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/2586808"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645709.664328"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1959.9.129"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265534"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646891.709290"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30124-0_3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/6.2.305"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806913"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/420966"},{"key":"e_1_3_2_1_23_1","volume-title":"STACS","author":"B.","year":"2011","unstructured":"B. ten Cate and L. Segoufin. Unary negation . In STACS , 2011 . B. ten Cate and L. Segoufin. Unary negation. In STACS, 2011."},{"key":"e_1_3_2_1_24_1","volume-title":"IJCAI","author":"Cate B.","year":"2011","unstructured":"B. ten Cate , E. Franconi , and I. Seylan . Beth definability in expressive description logics . In IJCAI , 2011 . B. ten Cate, E. Franconi, and I. Seylan. Beth definability in expressive description logics. In IJCAI, 2011."}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":22,"alternative-id":["10.1145\/2603088.2603108","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603108","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}