{"type":"ScholarlyArticle","title":"Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying","authors":[{"name":"Andre Hernich","slug":"andre-hernich","given":"Andre","family":"Hernich","affiliation":"University of Liverpool , UK"},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"University of Bremen , Germany"},{"name":"Fabio Papacchini","slug":"fabio-papacchini","given":"Fabio","family":"Papacchini","affiliation":"University of Liverpool , UK"},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":"University of Liverpool , UK"}],"abstract":"In ontology-mediated querying with an expressive description logic L, two desirable properties of a TBox T are (1) being able to replace T with a TBox formulated in the Horn-fragment of L without affecting the answers to conjunctive queries, and (2) that every conjunctive query can be evaluated in PTime w.r.t. T. We investigate in which cases (1) and (2) are equivalent, finding that the answer depends on whether the unique name assumption (UNA) is made, on the description logic under consideration, and on the nesting depth of quantifiers in the TBox. We also clarify the relationship between query evaluation with and without UNA and consider natural variations of property (1).","doi":"10.24963/ijcai.2018/257","url":"https://ijcai.org/proceedings/2018/257","pdf":"https://ijcai.org/proceedings/2018/0257.pdf","markdown":"https://ijcai.org/proceedings/2018/257.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/257","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":257,"pages":{"first":1861,"last":1867},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Multidisciplinary Topics and Applications: Databases"],"videos":[],"references":[{"position":1,"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":2,"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, pages 218-307, 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":3,"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":4,"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 IJCAI, pages 965-971, 2016.","title":"First order-rewritability and containment of conjunctive queries in Horn description logics","authors":"Bienvenu","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/141"},{"position":5,"raw":"[Botoeva et al., 2016a] Elena Botoeva, Boris Konev, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Za- kharyaschev. Inseparability and conservative extensions of description logic ontologies: A survey. In Reasoning Web, pages 27-89, 2016.","title":"Inseparability and conservative extensions of description logic ontologies: A survey","authors":"Botoeva","year":"2016","venue":"Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Botoeva et al., 2016b] Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Za- kharyaschev. Query-based entailment and inseparability for ALC ontologies. In IJCAI, pages 1001-1007, 2016.","title":"Query-based entailment and inseparability for ALC ontologies","authors":"Botoeva","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/146"},{"position":7,"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. Artificial Intelligence, 195:335-360, 2013.","title":"Data complexity of query answering in description logics","authors":"Calvanese","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Carral et al., 2014] David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler, and Ian Hor- rocks. EL-ifying ontologies. In IJCAR, pages 464-479, 2014.","title":"EL-ifying ontologies","authors":"David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler, Ian Horrocks","year":"2014","venue":"IJCAR","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chang and Keisler, 1990] C. C. Chang and H. Jerome Keisler. Model Theory. Elsevier, 1990.","title":"Model Theory","authors":"C C Chang, H Jerome Keisler","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eiter et al., 2008] Thomas Eiter, Georg Gottlob, Magdalena Ortiz, and Mantas Simkus. Query answering in the de- scription logic Horn-SHIQ. In JELIA, pages 166-179, 2008.","title":"Query answering in the description logic Horn-SHIQ","authors":"Thomas Eiter, Georg Gottlob, Magdalena Ortiz, Mantas Simkus","year":"2008","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Feier et al., 2017] Cristina Feier, Carsten Lutz, and Antti Kuusisto. Rewritability in monadic disjunctive datalog, mmsnp, and expressive description logics. In ICDT, 2017.","title":"Rewritability in monadic disjunctive datalog, mmsnp, and expressive description logics","authors":"Cristina Feier, Carsten Lutz, Antti Kuusisto","year":"2017","venue":"ICDT","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hernich et al., 2017] Andre Hernich, Carsten Lutz, Fabio Papacchini, and Frank Wolter. Dichotomies in ontology- mediated querying with the guarded fragment. In PODS, 2017.","title":"Dichotomies in ontologymediated querying with the guarded fragment","authors":"Andre Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter","year":"2017","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hustadt et al., 2007] Ullrich Hustadt, Boris Motik, and Ul- rike Sattler. Reasoning in description logics by a reduction to disjunctive datalog. J. Autom. Reasoning, 39(3):351-384, 2007.","title":"Reasoning in description logics by a reduction to disjunctive datalog","authors":"Ullrich Hustadt, Boris Motik, Ulrike Sattler","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kaminski and Grau, 2015] Mark Kaminski and Bernardo Cuenca Grau. Computing Horn rewrit- ings of description logics ontologies. In IJCAI, pages 3091-3097, 2015.","title":"Computing Horn rewritings of description logics ontologies","authors":"Mark Kaminski, Bernardo Cuenca Grau","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/436"},{"position":15,"raw":"[Kaminski et al., 2016] Mark Kaminski, Yavor Nenov, and Bernardo Cuenca Grau. Datalog rewritability of disjunctive datalog programs and non-Horn ontologies. Artif. Intell., 236:90-118, 2016.","title":"Datalog rewritability of disjunctive datalog programs and non-Horn ontologies","authors":"Kaminski","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kazakov, 2009] Yevgeny Kazakov. Consequence-driven rea- soning for Horn-SHIQ ontologies. In Craig Boutilier, editor, IJCAI, pages 2040-2045, 2009.","title":"Consequence-driven reasoning for Horn-SHIQ ontologies","authors":"Yevgeny Kazakov","year":"2009","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2009/336"},{"position":17,"raw":"[Konev et al., 2016] Boris Konev, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Conservative rewritability of description logic TBoxes. In IJCAI, pages 1153-1159, 2016.","title":"Conservative rewritability of description logic TBoxes","authors":"Boris Konev, Carsten Lutz, Frank Wolter, Michael Zakharyaschev","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/167"},{"position":18,"raw":"[Kontchakov and Zakharyaschev, 2014] Roman Kontchakov and Michael Zakharyaschev. An introduction to description logics and query rewriting. In Proc. of Reasoning Web, pages 195-244, 2014.","title":"Roman Kontchakov and Michael Zakharyaschev. An introduction to description logics and query rewriting","authors":"Zakharyaschev Kontchakov","year":"2014","venue":"Proc. of Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Krisnadhi and Lutz, 2007] Adila Krisnadhi and Carsten Lutz. Data complexity in the EL family of DLs. In Proc. of DL, 2007.","title":"Adila Krisnadhi and Carsten Lutz. Data complexity in the EL family of DLs","authors":"Lutz Krisnadhi","year":"2007","venue":"Proc. of DL","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Krötzsch et al., 2007] Markus Krötzsch, Sebastian Rudolph, and Pascal Hitzler. Complexity boundaries for Horn de- scription logics. In AAAI, pages 452-457, 2007.","title":"Complexity boundaries for Horn description logics","authors":"Krötzsch","year":"2007","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":21,"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":22,"raw":"[Lutz and Wolter, 2017] Carsten Lutz and Frank Wolter. The Data Complexity of Description Logic Ontologies. Log- ical Methods in Computer Science, Volume 13, Issue 4, November 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":23,"raw":"[Lutz et al., 2011] Carsten Lutz, Robert Piro, and Frank Wolter. Description logic TBoxes: Model-theoretic charac- terizations and rewritability. In IJCAI, 2011.","title":"Description logic TBoxes: Model-theoretic characterizations and rewritability","authors":"Carsten Lutz, Robert Piro, Frank Wolter","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/169"},{"position":24,"raw":"[Ortiz et al., 2010] Magdalena Ortiz, Sebastian Rudolph, and Mantas Simkus. Worst-case optimal reasoning for the horn- dl fragments of OWL 1 and 2. In KR, 2010.","title":"Worst-case optimal reasoning for the horndl fragments of OWL 1 and 2","authors":"Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ortiz et al., 2011] Magdalena Ortiz, Sebastian Rudolph, and Mantas Simkus. Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In IJCAI, pages 1039-1044, 2011.","title":"Query answering in the Horn fragments of the description logics SHOIQ and SROIQ","authors":"Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/178"},{"position":26,"raw":"[Parsia et al., 2017] Bijan Parsia, Nicolas Matentzoglu, Rafael S. Gonc ¸alves, Birte Glimm, and Andreas Steigmiller. The OWL reasoner evaluation (ORE) 2015 competition re- port. J. Autom. Reasoning, 59(4):455-482, 2017.","title":"The OWL reasoner evaluation (ORE) 2015 competition report","authors":"Bijan Parsia, Nicolas Matentzoglu, Rafael S Gonc, Birte Glimm, Andreas Steigmiller","year":"2017","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.","title":"Linking data to ontologies","authors":"Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati","year":"2008","venue":"J. Data Semantics","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Schaerf, 1993] Andrea Schaerf. On the complexity of the instance checking problem in concept languages with exis- tential quantification. J. of Intel. Inf. Systems, 2:265-278, 1993.","title":"On the complexity of the instance checking problem in concept languages with existential quantification","authors":"Andrea Schaerf","year":"1993","venue":"J. of Intel. Inf. Systems","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Whetzel et al., 2011] Patricia L Whetzel, Natalya F Noy, Nigam H Shah, Paul R Alexander, Csongor Nyulas, Tania Tudorache, and Mark A Musen. Bioportal. Nucleic acids research, 39(suppl 2):W541-W545, 2011.","title":"Bioportal","authors":"Patricia L Whetzel, Natalya F Noy, H Nigam, Shah, Csongor Paul R Alexander, Tania Nyulas, Mark A Tudorache, Musen","year":"2011","venue":"Nucleic acids research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}