{"type":"ScholarlyArticle","title":"Answering Counting Queries over DL-Lite Ontologies","authors":[{"name":"Meghyn Bienvenu","slug":"meghyn-bienvenu","given":"Meghyn","family":"Bienvenu","affiliation":"University of Bordeaux , CNRS , Bordeaux INP , LaBRI , Talence , France"},{"name":"Quentin Manière","slug":"quentin-maniere","given":"Quentin","family":"Manière","affiliation":"University of Bordeaux , CNRS , Bordeaux INP , LaBRI , Talence , France"},{"name":"Michaël Thomazo","slug":"michael-thomazo","given":"Michael","family":"Thomazo","affiliation":"Inria , DI ENS , ENS , CNRS , University PSL , Paris , France"}],"abstract":"Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communities for more than a decade. The vast majority of work on OMQA focuses on conjunctive queries, whereas more expressive queries that feature counting or other forms of aggregation remain largely unexplored. In this paper, we introduce a general form of counting query, relate it to previous proposals, and study the complexity of answering such queries in the presence of DL-Lite ontologies. As it follows from existing work that query answering is intractable and often of high complexity, we consider some practically relevant restrictions, for which we establish improved complexity bounds.","doi":"10.24963/ijcai.2020/223","url":"https://ijcai.org/proceedings/2020/223","pdf":"https://ijcai.org/proceedings/2020/0223.pdf","markdown":"https://ijcai.org/proceedings/2020/223.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/223","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":223,"pages":{"first":1608,"last":1614},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24498/file_24498.m3u8","length_sec":287,"provider":"hls"}],"references":[{"position":1,"raw":"[Aehlig et al., 2007] Klaus Aehlig, Stephen Cook, and Phuong Nguyen. Relativizing Small Complexity Classes and Their Theories. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007.","title":"Relativizing Small Complexity Classes and Their Theories","authors":"Aehlig","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Albert, 1991] Joseph Albert. Algebraic properties of bag data types. In Proceedings of the 17th International Con- ference on Very Large Data Bases (VLDB), pages 211- 219, 1991.","title":"Algebraic properties of bag data types","authors":"Joseph Albert","year":"1991","venue":"Proceedings of the 17th International Conference on Very Large Data Bases (VLDB)","doi":null,"url":null,"internal_url":null},{"position":3,"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":4,"raw":"[Bailey et al., 2007] Delbert D. Bailey, Víctor Dalmau, and Phokion G. Kolaitis. Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics, 155(12):1627 -1639, 2007.","title":"Phase transitions of PP-complete satisfiability problems","authors":"Delbert D Bailey, Víctor Dalmau, Phokion G Kolaitis","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bienvenu and Ortiz, 2015] Meghyn Bienvenu and Mag- dalena Ortiz. Ontology-mediated query answering with data-tractable description logics. In Tutorial Lectures of the 11th Reasoning Web International Summer School, 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":"Tutorial Lectures of the 11th Reasoning Web International Summer School","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bienvenu et al., 2012] Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. Query containment in description log- ics reconsidered. In Proceedings of the 13th International Conference on the Principles of Knowledge Representa- tion and Reasoning (KR), 2012.","title":"Query containment in description logics reconsidered","authors":"Bienvenu","year":"2012","venue":"Proceedings of the 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bienvenu et al., 2013] Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, and Guohui Xiao. Tractable queries for lightweight description logics. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pages 768-774, 2013.","title":"Tractable queries for lightweight description logics","authors":"Bienvenu","year":"2013","venue":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2013/120"},{"position":8,"raw":"[Bienvenu et al., 2015a] Meghyn Bienvenu, Stanislav Kikot, and Vladimir V. Podolskii. Tree-like queries in OWL 2 QL: Succinctness and complexity results. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 317-328, 2015.","title":"Tree-like queries in OWL 2 QL: Succinctness and complexity results","authors":"Bienvenu","year":"2015","venue":"Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bienvenu et al., 2015b] Meghyn Bienvenu, Magdalena Or- tiz, and Mantas Simkus. Regular path queries in lightweight description logics: Complexity and algo- rithms. Journal of Artificial Intelligence Research (JAIR), 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":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calvanese et al., 2007] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Tractable reasoning and efficient query an- swering in description logics: The DL-Lite family. Journal of Automated Reasoning (JAR), 39(3):385-429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"Journal of Automated Reasoning (JAR)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calvanese et al., 2008] Diego Calvanese, Evgeny Khar- lamov, Werner Nutt, and Camilo Thorne. Aggregate queries over ontologies. In Proceedings of the 2nd Interna- tional Workshop on Ontologies and Information Systems for the Semantic Web (ONISW), pages 97-104, 2008.","title":"Aggregate queries over ontologies","authors":"Calvanese","year":"2008","venue":"Proceedings of the 2nd International Workshop on Ontologies and Information Systems for the Semantic Web (ONISW)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cima et al., 2019] Gianluca Cima, Charalampos Nikolaou, Egor V. Kostylev, Mark Kaminski, Bernardo Cuenca Grau, and Ian Horrocks. Bag semantics of dl-lite with function- ality axioms. In Proceedings of the 18th International Se- mantic Web Conference (ISWC), pages 128-144, 2019.","title":"Bag semantics of dl-lite with functionality axioms","authors":"Gianluca Cima, Charalampos Nikolaou, V Egor, Mark Kostylev, Bernardo Cuenca Kaminski, Ian Grau, Horrocks","year":"2019","venue":"Proceedings of the 18th International Semantic Web Conference (ISWC)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Console et al., 2017] Marco Console, Paolo Guagliardo, and Leonid Libkin. On querying incomplete information in databases under bag semantics. In Carles Sierra, editor, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 993-999, 2017.","title":"On querying incomplete information in databases under bag semantics","authors":"Marco Console, Paolo Guagliardo, Leonid Libkin","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2017/138"},{"position":14,"raw":"[Garey et al., 1976] M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237 -267, 1976.","title":"Some simplified NP-complete graph problems","authors":"M R Garey, D S Johnson, L Stockmeyer","year":"1976","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gonthier, 2008] Georges Gonthier. Formal proof -The four-color theorem. Notices of the American Mathemat- ical Society, 55(11):1382-1393, 2008.","title":"Formal proof -The four-color theorem","authors":"Georges Gonthier","year":"2008","venue":"Notices of the American Mathematical Society","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Grau et al., 2013] Bernardo Cuenca Grau, Ian Horrocks, Markus Krötzsch, Clemens Kupke, Despoina Magka, Boris Motik, and Zhe Wang. Acyclicity notions for ex- istential rules and their application to query answering in ontologies. Journal of Artificial Intelligence Research (JAIR), 47:741-808, 2013.","title":"Acyclicity notions for existential rules and their application to query answering in ontologies","authors":"Cuenca Bernardo, Ian Grau, Markus Horrocks, Clemens Krötzsch, Despoina Kupke, Boris Magka, Zhe Motik, Wang","year":"2013","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":17,"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. Journal of Web Semantics (JWS), 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":"Journal of Web Semantics (JWS)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hernich and Kolaitis, 2017] André Hernich and Phokion G. Kolaitis. Foundations of information integration under bag semantics. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-12, 2017.","title":"Foundations of information integration under bag semantics","authors":"Kolaitis Hernich, André Hernich, Phokion G Kolaitis","year":"2017","venue":"Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kostylev and Reutter, 2015] Egor V. Kostylev and Juan L. Reutter. Complexity of answering counting aggregate queries over DL-Lite. Journal of Web Semantics (JWS), 33(1):94-111, 2015.","title":"Complexity of answering counting aggregate queries over DL-Lite","authors":"V Egor, Juan L Kostylev, Reutter","year":"2015","venue":"Journal of Web Semantics (JWS)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Libkin, 2001] Leonid Libkin. Expressive power of SQL. In Proceedings of the 8th International Conference on Database Theory (ICDT), pages 1-21, 2001.","title":"Expressive power of SQL","authors":"Leonid Libkin, Libkin","year":"2001","venue":"Proceedings of the 8th International Conference on Database Theory (ICDT)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Nikolaou et al., 2019] Charalampos Nikolaou, Egor V. Kostylev, George Konstantinidis, Mark Kaminski, Bernardo Cuenca Grau, and Ian Horrocks. Foundations of ontology-based data access under bag semantics. Artificial Intelligence (AIJ), 274:91 -132, 2019.","title":"Foundations of ontology-based data access under bag semantics","authors":"Charalampos Nikolaou, V Egor, George Kostylev, Mark Konstantinidis, Bernardo Cuenca Kaminski, Ian Grau, Horrocks","year":"2019","venue":"Artificial Intelligence (AIJ)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. Journal of 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":"Journal of Data Semantics","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Xiao et al., 2018] Guohui Xiao, Diego Calvanese, Roman Kontchakov, Domenico Lembo, Antonella Poggi, Ric- cardo Rosati, and Michael Zakharyaschev. Ontology- based data access: A survey. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pages 5511-5519, 2018.","title":"Ontologybased data access: A survey","authors":"Guohui Xiao, Diego Calvanese, Roman Kontchakov, Domenico Lembo, Antonella Poggi, Riccardo Rosati, Michael Zakharyaschev","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}