{"type":"ScholarlyArticle","title":"Finite Entailment of UCRPQs over ALC Ontologies (Extended Abstract)","authors":[{"name":"Víctor Gutiérrez-Basulto","slug":"victor-gutierrez-basulto","given":"Víctor","family":"Gutiérrez-Basulto","affiliation":"Cardiff University , UK"},{"name":"Albert Gutowski","slug":"albert-gutowski","given":"Albert","family":"Gutowski","affiliation":"University of Warsaw , Poland"},{"name":"Yazmín Ibáñez-García","slug":"yazmin-ibanez-garcia","given":"Yazmín","family":"Ibáñez-García","affiliation":"Cardiff University , UK"},{"name":"Filip Murlak","slug":"filip-murlak","given":"Filip","family":"Murlak","affiliation":"University of Warsaw , Poland"}],"abstract":"We investigate the problem of finite entailment of ontology-mediated queries. We consider the expressive query language, unions of conjunctive regular path queries (UCRPQs), extending  the well-known class of  unions of conjunctive queries, with regular expressions over roles. We look at ontologies formulated using the description logic ALC, and show a tight 2ExpTime upper bound for finite entailment of UCRPQs.","doi":"10.24963/ijcai.2023/717","url":"https://ijcai.org/proceedings/2023/717","pdf":"https://ijcai.org/proceedings/2023/0717.pdf","markdown":"https://ijcai.org/proceedings/2023/717.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/717","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":717,"pages":{"first":6442,"last":6446},"keywords":["Sister Conferences Best Papers: Knowledge Representation and Reasoning"],"videos":[],"references":[{"position":1,"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":2,"raw":"[Bednarczyk and Kieroński, 2022] Bartosz Bednarczyk and Emanuel Kieroński. Finite entailment of local queries in the Z family of description logics. In Proc. of AAAI-2022, 2022.","title":"Finite entailment of local queries in the Z family of description logics","authors":"Bartosz Bednarczyk, Emanuel Kieroński","year":"2022","venue":"Proc. of AAAI-2022","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bednarczyk and Rudolph, 2019] Bartosz Bednarczyk and Sebastian Rudolph. Worst-case optimal querying of very expressive description logics with path expressions and succinct counting. In IJCAI, pages 1530-1536. ijcai.org, 2019.","title":"Worst-case optimal querying of very expressive description logics with path expressions and succinct counting","authors":"Bartosz Bednarczyk, Sebastian Rudolph","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/212"},{"position":4,"raw":"[Bienvenu et al., 2015] Meghyn Bienvenu, Magdalena Ortiz, and Mantas Simkus. Regular path queries in lightweight description logics: Complexity and algorithms. J. Artif. Intell. Res., 53:315-374, 2015.","title":"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":5,"raw":"[Bojańczyk and Parys, 2011] Mikolaj Bojańczyk and Pawel Parys. XPath evaluation in linear time. J. ACM, 58(4):17:1-17:33, 2011.","title":"Mikolaj Bojańczyk and Pawel Parys. XPath evaluation in linear time","authors":"Parys Bojańczyk","year":"2011","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Calvanese et al., 2000] Diego Calvanese, Giuseppe De Gia- como, Maurizio Lenzerini, and Moshe Y. Vardi. Contain- ment of conjunctive regular path queries with inverse. In KR, pages 176-185.","title":"Containment of conjunctive regular path queries with inverse","authors":"Calvanese","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Morgan Kaufmann, 2000. [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":"Morgan Kaufmann, ; Calvanese","year":"2000","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen et al., 2020] Chuming Chen, Hongzhan Huang, Karen E. Ross, Julie E. Cowart, Cecilia N. Arighi, Cathy H. Wu, and Darren A. Natale. Protein ontology on the semantic web for knowledge discovery. Scientific Data, 7(1):337, 2020.","title":"Protein ontology on the semantic web for knowledge discovery","authors":"Chuming Chen, Hongzhan Huang, Karen E Ross, Julie E Cowart, Cecilia N Arighi, Cathy H Wu, Darren A Natale","year":"2020","venue":"Scientific Data","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cook et al., 2016] Charles E Cook, Mary Todd Bergman, Robert D Finn, Guy Cochrane, Ewan Birney, and Rolf Ap- weiler. The European Bioinformatics Institute in 2016: Data growth and integration. Nucleic acids research, 44:D20-D26, 2016.","title":"The European Bioinformatics Institute in 2016: Data growth and integration","authors":"Mary Todd Charles E Cook, Robert D Bergman, Guy Finn, Ewan Cochrane, Rolf Birney, Apweiler","year":"2016","venue":"Nucleic acids research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Danielski and Kieronski, 2019] Daniel Danielski and Emanuel Kieronski. Finite satisfiability of unary negation fragment with transitivity. In MFCS, volume 138 of LIPIcs, pages 17:1-17:15, 2019.","title":"Finite satisfiability of unary negation fragment with transitivity","authors":"Daniel Danielski, Emanuel Kieronski","year":"2019","venue":"MFCS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Florescu et al., 1998] Daniela Florescu, Alon Y. Levy, and Dan Suciu. Query containment for conjunctive queries with regular expressions. In PODS, pages 139-148. ACM Press, 1998.","title":"Query containment for conjunctive queries with regular expressions","authors":"Daniela Florescu, Alon Y Levy, Dan Suciu","year":"1998","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Galgonek et al., 2016] Jakub Galgonek, Tomáš Hurt, Ven- dula Michlíková, Petr Onderka, Jan Schwarz, and Jiří Vondrášek. Advanced SPARQL querying in small molecule databases. Journal of Cheminformatics, 8(1):31, 2016.","title":"Advanced SPARQL querying in small molecule databases","authors":"Jakub Galgonek, Tomáš Hurt, Vendula Michlíková, Petr Onderka, Jan Schwarz, Jiří Vondrášek","year":"2016","venue":"Journal of Cheminformatics","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ginzburg, 1968] Abraham Ginzburg. Algebraic Theory of Automata. ACM Monograph Series. Academic Press, 1968.","title":"Abraham Ginzburg. Algebraic Theory of Automata","authors":"Ginzburg","year":"1968","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gogacz et al., 2018] Tomasz Gogacz, Yazmin Ibáñez- García, and Filip Murlak. Finite query answering in expressive description logics with transitive roles. In Proc. of KR-18, 2018.","title":"Finite query answering in expressive description logics with transitive roles","authors":"Tomasz Gogacz, Yazmin Ibáñez-García, Filip Murlak","year":"2018","venue":"Proc. of KR-18","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gogacz et al., 2019] Tomasz Gogacz, Víctor Gutiérrez- Basulto, Yazmín Ibáñez-García, Jean Christoph Jung, and Filip Murlak. On finite and unrestricted query entailment beyond SQ with number restrictions on transitive roles. In IJCAI, pages 1719-1725. ijcai.org, 2019.","title":"On finite and unrestricted query entailment beyond SQ with number restrictions on transitive roles","authors":"Tomasz Gogacz, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Jean, Christoph Jung, Filip Murlak","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/238"},{"position":16,"raw":"[Gogacz et al., 2020] Tomasz Gogacz, Víctor Gutiérrez- Basulto, Albert Gutowski, Yazmín Ibáñez-García, and Filip Murlak. On finite entailment of non-local queries in description logics. In KR, pages 424-433, 2020.","title":"On finite entailment of non-local queries in description logics","authors":"Tomasz Gogacz, Víctor Gutiérrez-Basulto, Albert Gutowski, Yazmín Ibáñez-García, Filip Murlak","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gutiérrez-Basulto et al., 2018] Víctor Gutiérrez-Basulto, Yazmín Angélica Ibáñez-García, and Jean Christoph Jung. Answering regular path queries over SQ ontologies. In AAAI, pages 1845-1852. AAAI Press, 2018.","title":"Answering regular path queries over SQ ontologies","authors":"Gutiérrez-Basulto","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gutiérrez-Basulto et al., 2022] Víctor Gutiérrez-Basulto, Albert Gutowski, Yazmín Ibáñez-García, and Filip Murlak. Finite entailment of ucrpqs over ALC ontologies. In KR, 2022.","title":"Finite entailment of ucrpqs over ALC ontologies","authors":"Víctor Gutiérrez-Basulto, Albert Gutowski, Yazmín Ibáñez-García, Filip Murlak","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hodkinson and Otto, 2003] Ian M. Hodkinson and Martin Otto. Finite conformal hypergraph covers and gaifman cliques in finite structures. Bull. Symb. Log., 9(3):387- 407, 2003.","title":"Finite conformal hypergraph covers and gaifman cliques in finite structures","authors":"Ian M Hodkinson, Martin Otto","year":"2003","venue":"Bull. Symb. Log","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hu et al., 2015] Wei Hu, Honglei Qiu, and Michel Dumon- tier. Link analysis of life science linked data. In ISWC (2), 2015.","title":"Link analysis of life science linked data","authors":"Wei Hu, Honglei Qiu, Michel Dumontier","year":"2015","venue":"ISWC (2)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Ibáñez-García et al., 2014] Yazmín Angélica Ibáñez- García, Carsten Lutz, and Thomas Schneider. Finite model reasoning in Horn description logics. In KR, 2014.","title":"Finite model reasoning in Horn description logics","authors":"Ibáñez-García","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lysenko et al., 2016] Artem Lysenko, Irina A. Roznovȃt ¸, Mansoor Saqi, Alexander Mazein, Christopher J. Rawl- ings, and Charles Auffray. Representing and querying dis- ease networks using graph databases. BioData Mining, 9(1):23, 2016.","title":"Representing and querying disease networks using graph databases","authors":"Artem Lysenko, Irina A Roznovȃt, ¸, Mansoor Saqi, Alexander Mazein, Christopher J Rawlings, Charles Auffray","year":"2016","venue":"BioData Mining","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Ortiz and Simkus, 2014] Magdalena Ortiz and Mantas Simkus. Revisiting the hardness of query answering in expressive description logics. In RR, volume 8741 of Lecture Notes in Computer Science, pages 216-223. Springer, 2014.","title":"Revisiting the hardness of query answering in expressive description logics","authors":"Simkus Ortiz, Magdalena Ortiz, Mantas Simkus","year":"2014","venue":"RR","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rajabi and Sanchez-Alonso, 2021] Enayat Rajabi and Sal- vador Sanchez-Alonso. Knowledge discovery using SPARQL property path: The case of disease data set. Jour- nal of Information Science, 47(5):677-687, 2021.","title":"Knowledge discovery using SPARQL property path: The case of disease data set","authors":"Sanchez-Alonso ; Enayat Rajabi, Salvador Rajabi, Sanchez-Alonso","year":"2021","venue":"Journal of Information Science","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rosati, 2008] Riccardo Rosati. Finite model reasoning in DL-Lite. In ESWC, 2008.","title":"Finite model reasoning in DL-Lite","authors":"Riccardo Rosati","year":"2008","venue":"ESWC","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rudolph, 2016] Sebastian Rudolph. Undecidability results for database-inspired reasoning problems in very expres- sive description logics. In KR, pages 247-257. AAAI Press, 2016.","title":"Undecidability results for database-inspired reasoning problems in very expressive description logics","authors":"Rudolph ;, Sebastian Rudolph","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Schneider and Simkus, 2020] Thomas Schneider and Man- tas Simkus. Ontologies and data management: A brief survey. Künstliche Intell., 34(3):329-353, 2020.","title":"Ontologies and data management: A brief survey","authors":"Simkus Schneider","year":"2020","venue":"Künstliche Intell","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., 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","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}