{"type":"ScholarlyArticle","title":"Compiling Model Representations for Querying Large ABoxes in Expressive DLs","authors":[{"name":"Labinot Bajraktari","slug":"labinot-bajraktari","given":"Labinot","family":"Bajraktari","affiliation":"Faculty of Informatics , TU Wien , Austria"},{"name":"Magdalena Ortiz","slug":"magdalena-ortiz","given":"Magdalena","family":"Ortiz","affiliation":"Faculty of Informatics , TU Wien , Austria"},{"name":"Mantas Simkus","slug":"mantas-simkus","given":"Mantas","family":"Simkus","affiliation":"Faculty of Informatics , TU Wien , Austria"}],"abstract":"Answering ontology mediated queries (OMQs) has received much attention in the last decade, but the big gap between practicable algorithms for lightweight ontologies, that are supported by implemented reasoners, and purely theoretical algorithms for expressive ontologies that are not amenable to implementation, has only increased. Towards narrowing the gap, we propose an algorithm to compile a representation of sets of models for ALCHI ontologies, which is sufficient for answering any monotone OMQ. Rather than reasoning for specific ABoxes, or being fully data-independent, we use generic descriptions of families of ABoxes, given by what we call profiles. Our model compilation algorithm runs on TBoxes and sets of profiles, and supports the incremental addition of new profiles. To illustrate the potential of our approach for OMQ answering, we implement a rewriting into an extension of Datalog for OMQs comprising reachability queries, and provide some promising evaluation results.","doi":"10.24963/ijcai.2018/234","url":"https://ijcai.org/proceedings/2018/234","pdf":"https://ijcai.org/proceedings/2018/0234.pdf","markdown":"https://ijcai.org/proceedings/2018/234.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/234","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":234,"pages":{"first":1691,"last":1698},"keywords":["Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Ahmetaj et al., 2016] Shqiponja Ahmetaj, Magdalena Or- tiz, and Mantas Simkus. Polynomial datalog rewritings for expressive description logics with closed predicates. In IJCAI 2016, USA, 2016.","title":"Shqiponja Ahmetaj, Magdalena Ortiz, and Mantas Simkus. Polynomial datalog rewritings for expressive description logics with closed predicates","authors":"Ahmetaj","year":"2016","venue":"IJCAI 2016","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baader, 2003] Franz Baader. The description logic hand- book: theory, implementation, and applications. Cam- bridge university press, 2003.","title":"The description logic handbook: theory, implementation, and applications","authors":"Franz Baader, Baader","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bajraktari et al., 2017] Labinot Bajraktari, Magdalena Or- tiz, and Mantas Simkus. Clopen knowledge bases: Com- bining description logics and answer set programming. In Proceedings of DL2017, Montpellier, France, 2017.","title":"Labinot Bajraktari, Magdalena Ortiz, and Mantas Simkus. Clopen knowledge bases: Combining description logics and answer set programming","authors":"Bajraktari","year":"2017","venue":"Proceedings of DL2017","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bienvenu et al., 2014a] Meghyn Bienvenu, Diego Cal- vanese, Magdalena Ortiz, and Mantas Šimkus. Nested reg- ular path queries in description logics. AAAI Press, 2014.","title":"Nested regular path queries in description logics","authors":"Bienvenu","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bienvenu et al., 2014b] 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":6,"raw":"[Bienvenu et al., 2015a] Meghyn Bienvenu, Magdalena Or- tiz, and Mantas Simkus. Regular path queries in lightweight description logics: Complexity and algo- rithms. J. Artif. Intell. Res., 53:315-374, 2015.","title":"Meghyn Bienvenu, Magdalena Ortiz, and Mantas Simkus. Regular path queries in lightweight description logics: Complexity and algorithms","authors":"Bienvenu","year":"2015","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bienvenu et al., 2015b] Meghyn Bienvenu, Magdalena Or- tiz, and Mantas Šimkus. Regular path queries in lightweight description logics: Complexity and algo- rithms. J. Artif. Intell. Res. (JAIR), 53:315-374, 2015.","title":"Meghyn Bienvenu, Magdalena Ortiz, and Mantas Šimkus. Regular path queries in lightweight description logics: Complexity and algorithms","authors":"Bienvenu","year":"2015","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calvanese et al., 2002] Diego Calvanese, Giuseppe De Gia- como, Maurizio Lenzerini, and Moshe Y. Vardi. Rewriting of regular expressions and regular path queries. J. Comput. Syst. Sci., 64(3):443-465, 2002.","title":"Rewriting of regular expressions and regular path queries","authors":"Calvanese","year":"2002","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calvanese et al., 2003] Diego Calvanese, Giuseppe De Gia- como, Maurizio Lenzerini, and Moshe Y. Vardi. Reason- ing on regular path queries. SIGMOD Record, 32(4):83- 92, 2003.","title":"Reasoning on regular path queries","authors":"Calvanese","year":"2003","venue":"SIGMOD Record","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calvanese et al., 2005] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Dl-lite: Tractable description logics for on- tologies. In In AAAI/IAAI 2005, USA, 2005.","title":"Dl-lite: Tractable description logics for ontologies","authors":"Calvanese","year":"2005","venue":"AAAI/IAAI 2005","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calvanese et al., 2008] Diego Calvanese, Giuseppe De Gi- acomo, and Maurizio Lenzerini. Conjunctive query containment and answering under description logic con- straints. ACM Trans. Comput. Log., 9(3), 2008.","title":"Conjunctive query containment and answering under description logic constraints","authors":"Calvanese","year":"2008","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Calvanese et al., 2014] Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Answering regular path queries in ex- pressive description logics via alternating tree-automata. Inf. Comput., 237:12-55, 2014.","title":"Answering regular path queries in expressive description logics via alternating tree-automata","authors":"Calvanese","year":"2014","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Eiter et al., 2012a] Thomas Eiter, Magdalena Ortiz, and Mantas Šimkus. Conjunctive query answering in the de- scription logic SH using knots. J. Comput. Syst. Sci., (1), 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":15,"raw":"[Eiter et al., 2012b] Thomas Eiter, Magdalena Ortiz, Man- tas Šimkus, Trung-Kien Tran, and Guohui Xiao. Query rewriting for Horn-SHIQ plus rules. AAAI Press, 2012.","title":"Query rewriting for Horn-SHIQ plus rules","authors":"Eiter","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gebser et al., 2011] Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Thomas Schneider. Potassco: The potsdam answer set solving collection. AI Commun., 24(2):107-124, 2011.","title":"Potassco: The potsdam answer set solving collection","authors":"Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, Marius Thomas Schneider","year":"2011","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. of ICLP/SLP 1988, pages 1070-1080. MIT Press, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proc. of ICLP/SLP 1988","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Glimm et al., 2014] Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, and Zhe Wang. Hermit: An OWL 2 reasoner. J. 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. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Glimm et al., 2017] Birte Glimm, Yevgeny Kazakov, and Trung-Kien Tran. Ontology materialization by abstraction refinement in horn SHOIF. In In AAAI 2017, USA, 2017.","title":"Ontology materialization by abstraction refinement in horn SHOIF","authors":"Glimm","year":"2017","venue":"AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gutiérrez-Basulto et al., 2015] Víctor Gutiérrez-Basulto, Yazmin Angélica Ibáñez-García, Roman Kontchakov, and Egor V. Kostylev. Queries with negation and inequalities over lightweight ontologies. J. Web Sem., 35:184-202, 2015.","title":"Queries with negation and inequalities over lightweight ontologies","authors":"Víctor Gutiérrez-Basulto, Yazmin Angélica Ibáñez-García, Roman Kontchakov, Egor V Kostylev","year":"2015","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hustadt et al., 2004] Ullrich Hustadt, Boris Motik, and Ul- rike Sattler. A decomposition rule for decision procedures by resolution-based calculi. In LPAR 2004, Uruguay, 2004.","title":"A decomposition rule for decision procedures by resolution-based calculi","authors":"Ullrich Hustadt, Boris Motik, Ulrike Sattler","year":"2004","venue":"LPAR 2004","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lutz, 2008] Carsten Lutz. The complexity of conjunctive query answering in expressive description logics. 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":"LNCS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Ortiz et al., 2011] Magdalena Ortiz, Sebastian Rudolph, and Mantas Simkus. Query answering in the Horn frag- ments of the description logics SHOIQ and SROIQ. In IJCAI 2011, Spain, 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 2011","doi":null,"url":null,"internal_url":"/proceedings/2011/178"},{"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. J. 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":"J. Applied Logic","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rodriguez-Muro et al., 2013] Mariano Rodriguez-Muro, Roman Kontchakov, and Michael Zakharyaschev. Ontology-based data access: Ontop of databases. volume 8218 of LNCS, pages 558-573. Springer, 2013.","title":"Mariano Rodriguez-Muro, Roman Kontchakov, and Michael Zakharyaschev. Ontology-based data access: Ontop of databases","authors":"Rodriguez-Muro","year":"2013","venue":"LNCS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rosati and Almatelli, 2010] Riccardo Rosati and Alessan- dro Almatelli. Improving query answering over dl-lite on- tologies. In KR 2010, Canada. AAAI Press, 2010.","title":"Improving query answering over dl-lite ontologies","authors":"Riccardo Rosati, Alessandro Almatelli","year":"2010","venue":"KR 2010","doi":null,"url":null,"internal_url":null},{"position":27,"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":28,"raw":"[Stefanoni et al., 2014] Giorgio Stefanoni, Boris Motik, Markus Krötzsch, and Sebastian Rudolph. The complex- ity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases. J. Artif. Intell. Res. (JAIR), 51:645-705, 2014.","title":"The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases","authors":"Giorgio Stefanoni, Boris Motik, Markus Krötzsch, Sebastian Rudolph","year":"2014","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Steigmiller et al., 2014] Andreas Steigmiller, Thorsten Liebig, and Birte Glimm. Konclude: System description. J. Web Sem., 27:78-85, 2014.","title":"Konclude: System description","authors":"Andreas Steigmiller, Thorsten Liebig, Birte Glimm","year":"2014","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}