{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:32Z","timestamp":1730280692793,"version":"3.28.0"},"reference-count":60,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785658","type":"proceedings-article","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T21:15:55Z","timestamp":1565039755000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["Model Comparison Games for Horn Description Logics"],"prefix":"10.1109","author":[{"given":"Jean Christoph","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Papacchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zakharyaschev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2586808"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004275029985"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06025-5_1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-2464(07)80008-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005080"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2886095"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2108242.2108247"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2009.04.002"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.04.003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008275906015"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2920"},{"key":"ref28","first-page":"161","article-title":"The product homomorphism problem and applications","author":"cate","year":"2015","journal-title":"Proceedings of ICDT"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-1452-8.50108-1"},{"key":"ref29","first-page":"7:1","article-title":"The complexity of reverse engineering problems for conjunctive queries","author":"barcel\u00f3","year":"2017","journal-title":"Proceedings of ICDT"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1017\/9781139025355","author":"baader","year":"2017","journal-title":"An introduction to description logics"},{"journal-title":"The Description Logic Handbook Theory Implementation and Applications","year":"2003","author":"baader","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.09.003"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/255"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/257"},{"key":"ref23","article-title":"The data complexity of description logic ontologies","volume":"13","author":"lutz","year":"2017","journal-title":"Logical Methods in Computer Science"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44960-4_3"},{"key":"ref25","first-page":"2639","article-title":"DL-Iearner: Learning concepts in description logics","volume":"10","author":"lehmann","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.2307\/2268172"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.2307\/2268661"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.10.007"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.226.7"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90014-Z"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(87)90018-5"},{"key":"ref55","first-page":"249","article-title":"On the complexity of fragments of modal logics","author":"nguyen","year":"2004","journal-title":"Proc AIM"},{"journal-title":"First order properties preserved by direct product","year":"1965","author":"weinstein","key":"ref54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574"},{"journal-title":"Model Theory","year":"1990","author":"chang","key":"ref52"},{"key":"ref10","first-page":"166","article-title":"Query answering in the description logic Horn-SHIQ","author":"eiter","year":"2008","journal-title":"Proceedings of JELIA"},{"key":"ref11","first-page":"1039","article-title":"Query answering in the Horn fragments of the description logics SHOIQ and SROIQ","author":"ortiz","year":"2011","journal-title":"Proceedings of JlCAI"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-10(2:3)2014","article-title":"Querying the guarded fragment","volume":"10","author":"b\u00e1r\u00e1ny","year":"2014","journal-title":"Logical Methods in Computer Science"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21768-0_9"},{"key":"ref13","article-title":"Acyclicity conditions and their application to query answering in description logics","author":"grau","year":"2012","journal-title":"Proceedings of KR"},{"key":"ref14","first-page":"965","article-title":"First order-rewritability and containment of conjunctive queries in Horn description logics","author":"bienvenu","year":"2016","journal-title":"Proceedings of JlCAI"},{"key":"ref15","first-page":"1114","article-title":"Ontology materialization by abstraction refinement in Horn SHOIF","author":"glimm","year":"2017","journal-title":"Proceedings of AAAI"},{"key":"ref16","first-page":"2040","article-title":"Consequence-driven reasoning for Horn-SHIQ ontolo-gies","author":"kazakov","year":"2009","journal-title":"Proceedings of IJCAI"},{"key":"ref17","volume":"8","author":"kr\u00f6tzsch","year":"2010","journal-title":"Description Logic Rules ser Studies on the Semantic Web"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2422085.2422087"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4866"},{"key":"ref4","first-page":"466","article-title":"Data complexity of reasoning in very expressive description logics","author":"hustadt","year":"2005","journal-title":"Proceedings of IJCAI"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005252908722"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9080-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"ref7","first-page":"364","article-title":"Pushing the ?? envelope","author":"baader","year":"2005","journal-title":"Proceedings of IJCAI"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209180"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2820"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2701414"},{"key":"ref45","article-title":"Description logic TBoxes: Model-theoretic characterizations and rewritability","author":"lutz","year":"2011","journal-title":"IJCAI"},{"key":"ref48","first-page":"749","article-title":"A van Benthem\/Rosen theorem for coalgebraic predicate logic","volume":"27","author":"schroder","year":"2017","journal-title":"J Log Comput"},{"key":"ref47","first-page":"253","article-title":"Simulations and bisimulations for coalge-braic modal logics","author":"gor\u00edn","year":"2013","journal-title":"Proceedings of CALCO 2013"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3873"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056108"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00109-X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785658.pdf?arnumber=8785658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:18:53Z","timestamp":1658247533000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785658","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}