{"type":"ScholarlyArticle","title":"From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying","authors":[{"name":"Cristina Feier","slug":"cristina-feier","given":"Cristina","family":"Feier","affiliation":"University of Bremen , Germany"},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"University of Bremen , Germany"},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":"University of Liverpool , UK"}],"abstract":"We consider ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and (unions) of conjunctive queries, studying the rewritability into OMQs based on instance queries (IQs). Our results include exact characterizations of when such a rewriting is possible and tight complexity bounds for deciding rewritability. We also give a tight complexity bound for the related problem of deciding whether a given MMSNP sentence (in other words: the complement of a monadic disjunctive Datalog program) is equivalent to a constraint satisfaction problem.","doi":"10.24963/ijcai.2018/250","url":"https://ijcai.org/proceedings/2018/250","pdf":"https://ijcai.org/proceedings/2018/0250.pdf","markdown":"https://ijcai.org/proceedings/2018/250.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/250","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":250,"pages":{"first":1810,"last":1816},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Multidisciplinary Topics and Applications: Databases"],"videos":[],"references":[{"position":1,"raw":"[Baader et al., 2016] Franz Baader, Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. Query and predicate emptiness in ontology-based data access. J. Artif. Intell. Res., 56:1-59, 2016.","title":"Query and predicate emptiness in ontology-based data access","authors":"Baader","year":"2016","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baader et al., 2017] Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. An Introduction to Description Logic. Cambridge University Press, 2017.","title":"An Introduction to Description Logic","authors":"Baader","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bienvenu and Ortiz, 2015] Meghyn Bienvenu and Mag- dalena Ortiz. Ontology-mediated query answering with data-tractable description logics. In Proc. of Reasoning Web, volume 9203 of LNCS, pages 218-307. Springer, 2015.","title":"Meghyn Bienvenu and Magdalena Ortiz. Ontology-mediated query answering with data-tractable description logics","authors":"Ortiz Bienvenu","year":"2015","venue":"Proc. of Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bienvenu et al., 2014] Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data ac- cess: A study through disjunctive Datalog, CSP, and MM- SNP. ACM Trans. Database Syst., 39(4):33:1-33:44, 2014.","title":"Ontology-based data access: A study through disjunctive Datalog, CSP, and MM-SNP","authors":"Bienvenu","year":"2014","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bourhis and Lutz, 2016] Pierre Bourhis and Carsten Lutz. Containment in monadic disjunctive datalog, MMSNP, and expressive description logics. In Proc. of KR, pages 207-216. AAAI Press, 2016.","title":"Containment in monadic disjunctive datalog, MMSNP, and expressive description logics","authors":"Lutz Bourhis, Pierre Bourhis, Carsten Lutz","year":"2016","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Calvanese et al., 1998] Diego Calvanese, Giuseppe De Gi- acomo, and Maurizio Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS1998, pages 149-158. ACM Press, 1998.","title":"On the decidability of query containment under constraints","authors":"Calvanese","year":"1998","venue":"Proc. of PODS1998","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calvanese et al., 2009] Diego Calvanese, Giuseppe De Gia- como, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Mariano Rodriguez-Muro, and Riccardo Rosati. Ontologies and databases: The DL-Lite approach. In Proc. of Reasoning Web 2009, volume 5689 of LNCS, pages 255-356. Springer, 2009.","title":"Ontologies and databases: The DL-Lite approach","authors":"Calvanese","year":"2009","venue":"Proc. of Reasoning Web 2009","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Eiter et al., 2012a] Thomas Eiter, Magdalena Ortiz, and Mantas Simkus. Conjunctive query answering in the de- scription logic SH using knots. J. Comput. Syst. Sci., 78(1):47-85, 2012.","title":"Conjunctive query answering in the description logic SH using knots","authors":"Eiter","year":"2012","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eiter et al., 2012b] Thomas Eiter, Magdalena Ortiz, Man- tas Simkus, Trung-Kien Tran, and Guohui Xiao. Query rewriting for Horn-SHIQ plus rules. In Proc. of AAAI. AAAI Press, 2012.","title":"Query rewriting for Horn-SHIQ plus rules","authors":"Eiter","year":"2012","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Feder and Vardi, 1998] Tomás Feder and Moshe Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput., 28(1):57-104, 1998.","title":"The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory","authors":"Vardi Feder, Tomás Feder, Moshe Y Vardi","year":"1998","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Feier et al., 2017] Cristina Feier, Antti Kuusisto, and Carsten Lutz. Rewritability in monadic disjunctive dat- alog, MMSNP, and expressive description logics (invited talk). In Proc. ICDT, volume 68 of LIPIcs, pages 1:1- 1:17. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. Glimm et al., 2008] Birte Glimm, Carsten Lutz, Ian Hor- rocks, and Ulrike Sattler. Conjunctive query answering for the description logic SHIQ. J. Artif. Intell. Res., 31:157- 204, 2008.","title":"Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics","authors":"Cristina Feier, Antti Kuusisto, Carsten Lutz, ; Glimm","year":"2008","venue":"Proc. ICDT","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Glimm et al., 2014] Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, and Zhe Wang. Hermit: An OWL 2 reasoner. J. of Autom. Reasoning, 53(3):245-269, 2014.","title":"Hermit: An OWL 2 reasoner","authors":"Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, Zhe Wang","year":"2014","venue":"J. of Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kikot and Zolin, 2013] Stanislav Kikot and Evgeny Zolin. Modal definability of first-order formulas with free vari- ables and query answering. J. Applied Logic, 11(2):190- 216, 2013.","title":"Modal definability of first-order formulas with free variables and query answering","authors":"Zolin Kikot, Stanislav Kikot, Evgeny Zolin","year":"2013","venue":"J. Applied Logic","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kikot et al., 2013] Stanislav Kikot, Dmitry Tsarkov, Michael Zakharyaschev, and Evgeny Zolin. Query answering via modal definability with FaCT++: First blood. In Proc. DL, volume 1014 of CEUR Workshop Proceedings, pages 328-340. CEUR-WS.org, 2013.","title":"Query answering via modal definability with FaCT++: First blood","authors":"Stanislav Kikot, Dmitry Tsarkov, Michael Zakharyaschev, Evgeny Zolin","year":"2013","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lutz and Wolter, 2017] Carsten Lutz and Frank Wolter. The data complexity of description logic ontologies. Logical Methods in Computer Science, 13(4), 2017.","title":"The data complexity of description logic ontologies","authors":"Wolter Lutz, Carsten Lutz, Frank Wolter","year":"2017","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lutz et al., 2009] Carsten Lutz, David Toman, and Frank Wolter. Conjunctive query answering in the description logic EL using a relational database system. In Proc. IJ- CAI, pages 2070-2075, 2009.","title":"Conjunctive query answering in the description logic EL using a relational database system","authors":"Carsten Lutz, David Toman, Frank Wolter","year":"2009","venue":"Proc. IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2009/341"},{"position":17,"raw":"[Lutz, 2008] Carsten Lutz. The complexity of conjunc- tive query answering in expressive description logics. In Proc. of IJCAR, volume 5195 of LNCS, pages 179-193. Springer, 2008.","title":"The complexity of conjunctive query answering in expressive description logics","authors":"Carsten Lutz","year":"2008","venue":"Proc. of IJCAR","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Madelaine and Stewart, 2007] Florent R. Madelaine and Iain A. Stewart. Constraint satisfaction, logic and forbid- den patterns. SIAM J. Comput., 37(1):132-163, 2007.","title":"Constraint satisfaction, logic and forbidden patterns","authors":"R Florent, Iain A Madelaine, Stewart","year":"2007","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Pérez-Urbina et al., 2010] Héctor Pérez-Urbina, Boris Motik, and Ian Horrocks. Tractable query answering and rewriting under description logic constraints. JAL, 8(2):186-209, 2010.","title":"Tractable query answering and rewriting under description logic constraints","authors":"Héctor Pérez-Urbina, Boris Motik, Ian Horrocks","year":"2010","venue":"JAL","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Sirin et al., 2007] Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, and Yarden Katz. Pellet: A practical OWL-DL reasoner. J. Web Sem., 5(2):51 -53, 2007.","title":"Pellet: A practical OWL-DL reasoner","authors":"Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, Yarden Katz","year":"2007","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Trivela et al., 2015] Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos B. Stamou. Optimis- ing resolution-based rewriting algorithms for OWL on- tologies. J. Web Sem., 33:30-49, 2015.","title":"Optimising resolution-based rewriting algorithms for OWL ontologies","authors":"Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, Giorgos B Stamou","year":"2015","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zhou et al., 2015] Yujiao Zhou, Bernardo Cuenca Grau, Ya- vor Nenov, Mark Kaminski, and Ian Horrocks. Pagoda: Pay-as-you-go ontology query answering using a datalog reasoner. J. Artif. Intell. Res., 54:309-367, 2015.","title":"Pagoda: Pay-as-you-go ontology query answering using a datalog reasoner","authors":"Yujiao Zhou, Bernardo Cuenca Grau, Yavor Nenov, Mark Kaminski, Ian Horrocks","year":"2015","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zolin, 2007] Evgeny Zolin. Modal logic applied to query answering and the case for variable modalities. In Proc. of DL, volume 250 of CEUR Workshop Proceedings. CEUR- WS.org, 2007.","title":"Modal logic applied to query answering and the case for variable modalities","authors":"Evgeny Zolin","year":"2007","venue":"CEUR Workshop Proceedings. CEUR-WS.org","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}