{"type":"ScholarlyArticle","title":"Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability","authors":[{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"University of Bremen , Germany"},{"name":"Leif Sabellek","slug":"leif-sabellek","given":"Leif","family":"Sabellek","affiliation":"University of Bremen , Germany"}],"abstract":"We consider ontology-mediated queries (OMQs) based on an EL\r\n  ontology and an atomic query (AQ), provide an ultimately\r\n  fine-grained analysis of data complexity and study rewritability\r\n  into linear Datalog-aiming to capture linear recursion in SQL.\r\n  Our main results are that every such OMQ is in AC0, \r\n  NL-complete or PTime-complete, and that containment in NL\r\n  coincides with rewritability into linear Datalog (whereas\r\n  containment in AC0 coincides with rewritability into first-order\r\n  logic). We establish natural characterizations of the three cases,\r\n  show that deciding linear Datalog rewritability (as well as the\r\n  mentioned complexities) is ExpTime-complete, give a way to\r\n  construct linear Datalog rewritings when they exist, and prove that\r\n  there is no constant bound on the arity of IDB relations in linear\r\n  Datalog rewritings.","doi":"10.24963/ijcai.2017/164","url":"https://ijcai.org/proceedings/2017/164","pdf":"https://ijcai.org/proceedings/2017/0164.pdf","markdown":"https://ijcai.org/proceedings/2017/164.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/164","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":164,"pages":{"first":1181,"last":1187},"keywords":["Multidisciplinary Topics and Applications: Database Systems","Knowledge Representation, Reasoning, and Logic: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul et al., 1995] Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.","title":"Foundations of Databases","authors":"Serge Abiteboul, Richard Hull, Victor Vianu","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Afrati and Cosmadakis, 1989] Foto N. Afrati and Stavros S. Cosmadakis. Expressiveness of restricted recursive queries (extended abstract). In Proc. of STOC, pages 113-126, 1989.","title":"Expressiveness of restricted recursive queries (extended abstract)","authors":"N Foto, Stavros S Afrati, Cosmadakis","year":"1989","venue":"Proc. of STOC","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baader et al., 2005] Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. of IJCAI, pages 364-369, 2005.","title":"Pushing the EL envelope","authors":"Baader","year":"2005","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baader et al., 2017] Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. An Introduction to Description Logics. Cambride University Press, 2017.","title":"An Introduction to Description Logics","authors":"Baader","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baget et al., 2009] Jean-Franc ¸ois Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. Extending decid- able cases for rules with existential variables. In Proc. of IJCAI, pages 677-682, 2009.","title":"Extending decidable cases for rules with existential variables","authors":"Baget","year":"2009","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/118"},{"position":6,"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":7,"raw":"[Bienvenu et al., 2013] Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. First order-rewritability of atomic queries in horn description logics. In Proc. of IJCAI, 2013.","title":"First order-rewritability of atomic queries in horn description logics","authors":"Bienvenu","year":"2013","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/118"},{"position":8,"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":9,"raw":"[Bienvenu et al., 2016] Meghyn Bienvenu, Peter Hansen, Carsten Lutz, and Frank Wolter. First order-rewritability and containment of conjunctive queries in horn description logics. In Proc. of IJCAI, 2016.","title":"First order-rewritability and containment of conjunctive queries in horn description logics","authors":"Bienvenu","year":"2016","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/141"},{"position":10,"raw":"[Calvanese et al., 2009] Diego Calvanese, Giuseppe De Gia- como, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Mariano Rodriguez-Muro, and Riccardo Rosati. On- tologies and databases: The DL-Lite approach. In Proc. of Reasoning Web 2009, pages 255-356, 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":11,"raw":"[Calvanese et al., 2013] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Data complexity of query answering in de- scription logics. Artif. Intell., 195:335-360, 2013.","title":"Data complexity of query answering in description logics","authors":"Calvanese","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dalmau and Krokhin, 2008] Víctor Dalmau and Andrei A. Krokhin. Majority constraints have bounded pathwidth duality. Eur. J. Comb., 29(4):821-837, 2008.","title":"Majority constraints have bounded pathwidth duality","authors":"Víctor Dalmau, Andrei A Krokhin","year":"2008","venue":"Eur. J. Comb","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Egri et al., 2007] László Egri, Benoit Larose, and Pascal Tes- son. Symmetric datalog and constraint satisfaction prob- lems in LogSpace. Electronic Colloquium on Computa- tional Complexity (ECCC), 14(024), 2007.","title":"Symmetric datalog and constraint satisfaction problems in LogSpace","authors":"László Egri, Benoit Larose, Pascal Tesson","year":"2007","venue":"Electronic Colloquium on Computational Complexity","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Eiter et al., 2012] Thomas Eiter, Magdalena Ortiz, Mantas Simkus, Trung-Kien Tran, and Guohui Xiao. Query rewrit- ing for Horn-SHIQ plus rules. In Proc. of AAAI. AAAI Press, 2012. [","title":"Query rewriting for Horn-SHIQ plus rules","authors":"Thomas Eiter, Magdalena Ortiz, Mantas Simkus, Trung-Kien Tran, Guohui Xiao","year":"2012","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Feier et al., 2017] Cristina Feier, Antti Kuusisto, and Carsten Lutz. Rewritability in monadic disjunctive dat- alog, MMSNP, and expressive description logics. In Proc. of ICDT, 2017.","title":"Rewritability in monadic disjunctive datalog, MMSNP, and expressive description logics","authors":"Cristina Feier, Antti Kuusisto, Carsten Lutz","year":"2017","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hansen et al., 2015] Peter Hansen, Carsten Lutz, İnanc ¸Sey- lan, and Frank Wolter. Efficient query rewriting in the description logic EL and beyond. In Proc. of IJCAI, 2015.","title":"Efficient query rewriting in the description logic EL and beyond","authors":"Peter Hansen, Carsten Lutz, Frank İnanc ¸seylan, Wolter","year":"2015","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/428"},{"position":17,"raw":"[Hustadt et al., 2005] Ullrich Hustadt, Boris Motik, and Ul- rike Sattler. Data complexity of reasoning in very expres- sive description logics. In Proc. of IJCAI, pages 466-471. Professional Book Center, 2005.","title":"Data complexity of reasoning in very expressive description logics","authors":"Ullrich Hustadt, Boris Motik, Ulrike Sattler","year":"2005","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2005/6"},{"position":18,"raw":"[Immerman, 1999] Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer, 1999.","title":"Descriptive complexity","authors":"Neil Immerman","year":"1999","venue":"Graduate texts in computer science","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kaminski et al., 2014] Mark Kaminski, Yavor Nenov, and Bernardo Cuenca Grau. Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning. In Proc. of AAAI, pages 1077-1083. AAAI Press, 2014.","title":"Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning","authors":"Mark Kaminski, Yavor Nenov, Bernardo Cuenca Grau","year":"2014","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kontchakov et al., 2013] Roman Kontchakov, Mariano Rodriguez-Muro, and Michael Zakharyaschev. Ontology- based data access with databases: A short course. In Reasoning Web, pages 194-229, 2013.","title":"Roman Kontchakov, Mariano Rodriguez-Muro, and Michael Zakharyaschev. Ontologybased data access with databases: A short course","authors":"Kontchakov","year":"2013","venue":"Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Krisnadhi and Lutz, 2007] Adila Krisnadhi and Carsten Lutz. Data complexity in the EL family of description logics. In Nachum Dershowitz and Andrei Voronkov, edi- tors, Proc. of LPAR, volume 4790 of LNAI, pages 333-347. Springer, 2007.","title":"Adila Krisnadhi and Carsten Lutz. Data complexity in the EL family of description logics","authors":"Lutz Krisnadhi","year":"2007","venue":"editors, Proc. of LPAR","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lutz and Wolter, 2010] Carsten Lutz and Frank Wolter. De- ciding inseparability and conservative extensions in the description logic EL. J. Symb. Comput., 45(2):194-228, 2010.","title":"Deciding inseparability and conservative extensions in the description logic EL","authors":"Wolter Lutz, Carsten Lutz, Frank Wolter","year":"2010","venue":"J. Symb. Comput","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lutz and Wolter, 2012] Carsten Lutz and Frank Wolter. Non- uniform data complexity of query answering in description logics. In Proc. of KR, 2012.","title":"Nonuniform data complexity of query answering in description logics","authors":"Wolter Lutz, Carsten Lutz, Frank Wolter","year":"2012","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":24,"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. Journal of Applied Logic, 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":"Journal of Applied Logic","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rosati, 2007] Riccardo Rosati. The limits of querying on- tologies. In Proc. of ICDT, volume 4353 of LNCS, pages 164-178. Springer, 2007.","title":"The limits of querying ontologies","authors":"Riccardo Rosati","year":"2007","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Scheffler, 1989] Petra Scheffler. Die Baumweite von Graphen als ein Mass für die Kompliziertheit algorithmis- cher Probleme. Report (Karl-Weierstrass-Institut für Math- ematik). Akademie der Wissenschaften der DDR, Karl- Weierstrass-Institut für Mathematik, 1989.","title":"Die Baumweite von Graphen als ein Mass für die Kompliziertheit algorithmischer Probleme","authors":"Petra Scheffler","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Trivela et al., 2015] Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos B. Stamou. Optimising resolution-based rewriting algorithms for OWL ontologies. 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}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}