{"type":"ScholarlyArticle","title":"Data Complexity in Expressive Description Logics with Path Expressions","authors":[{"name":"Bartosz Bednarczyk","slug":"bartosz-bednarczyk","given":"Bartosz","family":"Bednarczyk","affiliation":"Computational Logic Group , TU Dresden , Germany Institute of Computer Science ,; University of Wrocław , Poland"}],"abstract":"We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHbSelfregOIQ) over quasi-forests and establish its NP-completeness. This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family). Using the same technique, we establish coNEXPTIME-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.","doi":"10.24963/ijcai.2024/359","url":"https://ijcai.org/proceedings/2024/359","pdf":"https://ijcai.org/proceedings/2024/0359.pdf","markdown":"https://ijcai.org/proceedings/2024/359.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/359","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":359,"pages":{"first":3241,"last":3249},"keywords":["Knowledge Representation and Reasoning: KRR: Computational complexity of reasoning","Knowledge Representation and Reasoning: KRR: Description logics and ontologies"],"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 Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty- Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Ed- ucational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 -March 1, 2022, pages 5487- 5494. AAAI Press, 2022.","title":"Finite Entailment of Local Queries in the Z Family of Description Logics","authors":"Bartosz Bednarczyk, Emanuel Kieroński","year":"2022","venue":"Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event","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 Sarit Kraus, editor, Proceedings of the Twenty-Eighth International Joint Conference on Artifi- cial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, 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":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019","doi":null,"url":null,"internal_url":"/proceedings/2019/212"},{"position":4,"raw":"[Bienvenu et al., 2014] Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, and Mantas Simkus. Nested Regular Path Queries in Description Logics. In Chitta Baral, Giuseppe De Giacomo, and Thomas Eiter, editors, Prin- ciples of Knowledge Representation and Reasoning: Pro- ceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. AAAI Press, 2014.","title":"Nested Regular Path Queries in Description Logics","authors":"Bienvenu","year":"2014","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calvanese et al., 2009] Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Regular Path Queries in Expressive De- scription Logics with Nominals. In Craig Boutilier, editor, IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 714-720, 2009.","title":"Regular Path Queries in Expressive Description Logics with Nominals","authors":"Calvanese","year":"2009","venue":"IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Calvanese et al., 2016] Diego Calvanese, Magdalena Ortiz, and Mantas Simkus. Verification of Evolving Graph- structured Data under Expressive Path Constraints. In Wim Martens and Thomas Zeume, editors, 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016, volume 48 of LIPIcs, pages 15:1-15:19. Schloss Dagstuhl -Leibniz-Zentrum für Infor- matik, 2016.","title":"Verification of Evolving Graphstructured Data under Expressive Path Constraints","authors":"Calvanese","year":"2016","venue":"19th International Conference on Database Theory, ICDT 2016","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Hitzler et al., 2012] Pascal Hitzler, Markus Krötzsch, Bijan Parsia, Peter F. Patel-Schneider, and Sebastian Rudolph. OWL 2 Web Ontology Language Primer (Second Edition). World Wide Web Consortium (W3C), December 2012.","title":"OWL 2 Web Ontology Language Primer (Second Edition)","authors":"Pascal Hitzler, Markus Krötzsch, Bijan Parsia, F Peter, Sebastian Patel-Schneider, Rudolph","year":"2012","venue":"World Wide Web Consortium (W3C)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Jung et al., 2018] Jean Christoph Jung, Carsten Lutz, Mauri- cio Martel, and Thomas Schneider. Querying the Unary Negation Fragment with Regular Path Expressions. In Benny Kimelfeld and Yael Amsterdamer, editors, 21st In- ternational Conference on Database Theory, ICDT 2018, March 26-29, 2018, Vienna, Austria, volume 98 of LIPIcs, pages 15:1-15:18. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2018.","title":"Querying the Unary Negation Fragment with Regular Path Expressions","authors":"Jean Christoph, Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider","year":"2018","venue":"21st International Conference on Database Theory, ICDT 2018","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kazakov, 2008] Yevgeny Kazakov. RIQ and SROIQ are harder than SHOIQ. In Gerhard Brewka and Jérôme Lang, editors, Principles of Knowledge Representation and Rea- soning: Proceedings of the Eleventh International Confer- ence, KR 2008, Sydney, Australia, September 16-19, 2008, pages 274-284. AAAI Press, 2008.","title":"RIQ and SROIQ are harder than SHOIQ","authors":"Yevgeny Kazakov","year":"2008","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lutz, 2008a] Carsten Lutz. The Complexity of Conjunc- tive Query Answering in Expressive Description Logics. In Alessandro Armando, Peter Baumgartner, and Gilles Dowek, editors, Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195 of Lecture Notes in Computer Science, pages 179-193. Springer, 2008.","title":"The Complexity of Conjunctive Query Answering in Expressive Description Logics","authors":"Carsten Lutz, Lutz","year":"2008","venue":"Automated Reasoning, 4th International Joint Conference, IJCAR 2008","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lutz, 2008b] Carsten Lutz. Two Upper Bounds for Conjunc- tive Query Answering in SHIQ. In Franz Baader, Carsten Lutz, and Boris Motik, editors, Proceedings of the 21st International Workshop on Description Logics (DL2008), Dresden, Germany, May 13-16, 2008, volume 353 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.","title":"Two Upper Bounds for Conjunctive Query Answering in SHIQ","authors":"Carsten Lutz, Lutz","year":"2008","venue":"Proceedings of the 21st International Workshop on Description Logics (DL2008)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Mendelzon and Wood, 1995] Alberto O. Mendelzon and Pe- ter T. Wood. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing, 24(6):1235-1258, 1995.","title":"Finding Regular Simple Paths in Graph Databases","authors":"Alberto O Mendelzon, Peter T Wood","year":"1995","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ortiz and Simkus, 2012] Magdalena Ortiz and Mantas Simkus. Reasoning and Query Answering in Description Logics. In Thomas Eiter and Thomas Krennwallner, edi- tors, Reasoning Web. Semantic Technologies for Advanced Query Answering -8th International Summer School 2012, Vienna, Austria, September 3-8, 2012. Proceedings, volume 7487 of Lecture Notes in Computer Science, pages 1-53. Springer, 2012.","title":"Magdalena Ortiz and Mantas Simkus. Reasoning and Query Answering in Description Logics","authors":"Simkus Ortiz","year":"2012","venue":"editors, Reasoning Web. Semantic Technologies for Advanced Query Answering -8th International Summer School 2012","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Ortiz, 2010] Magdalena Ortiz. Query Answering in Expres- sive Description Logics: Techniques and Complexity Re- sults. PhD thesis, TU Wien, AT, 2010.","title":"Magdalena Ortiz. Query Answering in Expressive Description Logics: Techniques and Complexity Results","authors":"Ortiz","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Pratt-Hartmann, 2009] Ian Pratt-Hartmann. Data- Complexity of the Two-Variable Fragment with Counting Quantifiers. Information and Computation, 207(8):867- 888, 2009.","title":"Data-Complexity of the Two-Variable Fragment with Counting Quantifiers","authors":"Ian Pratt-Hartmann","year":"2009","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Sipser, 2013] Michael Sipser. Introduction to the Theory of Computation. Course Technology, Boston, MA, Third edition, 2013.","title":"Introduction to the Theory of Computation","authors":"Michael Sipser","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Vardi, 1982] Moshe Y. Vardi. The Complexity of Relational Query Languages (Extended Abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Com- puting (STOC 1982), STOC '82, page 137-146, New York, NY, USA, 1982. Association for Computing Machinery.","title":"The Complexity of Relational Query Languages (Extended Abstract)","authors":"Moshe Y Vardi","year":"1982","venue":"Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), STOC '82","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}