{"type":"ScholarlyArticle","title":"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting","authors":[{"name":"Bartosz Bednarczyk","slug":"bartosz-bednarczyk","given":"Bartosz","family":"Bednarczyk","affiliation":"Institute of Computer Science , University of Wrocław; Computational Logic Group , TU Dresden"},{"name":"Sebastian Rudolph","slug":"sebastian-rudolph","given":"Sebastian","family":"Rudolph","affiliation":"Computational Logic Group , TU Dresden"}],"abstract":"Among the most expressive knowledge representation formalisms are the description logics of the Z family. For well-behaved fragments of ZOIQ, entailment of positive two-way regular path queries is well known to be 2EXPTIME-complete under the proviso of unary encoding of numbers in cardinality constraints. We show that this assumption can be dropped without an increase in complexity and EXPTIME-completeness can be achieved when bounding the number of query atoms, using a novel reduction from query entailment to knowledge base satisfiability. These findings allow to strengthen other results regarding query entailment and query containment problems in very expressive description logics. Our results also carry over to GC2, the two-variable guarded fragment of first-order logic with counting quantifiers, for which hitherto only conjunctive query entailment has been investigated.","doi":"10.24963/ijcai.2019/212","url":"https://ijcai.org/proceedings/2019/212","pdf":"https://ijcai.org/proceedings/2019/0212.pdf","markdown":"https://ijcai.org/proceedings/2019/212.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/212","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":212,"pages":{"first":1530,"last":1536},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving"],"videos":[],"references":[{"position":1,"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, Proc. 14th Int. Conf. on Principles of Knowledge Representation and Reason- ing (KR'14), pages 218-227. AAAI Press, 2014.","title":"Nested regular path queries in description logics","authors":"Bienvenu","year":"2014","venue":"Proc. 14th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'14)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonatti et al., 2008] Piero A. Bonatti, Carsten Lutz, Aniello Murano, and Moshe Y. Vardi. The complexity of en- riched mu-calculi. Logical Methods in Computer Science, 4(3:11):1-27, 2008.","title":"The complexity of enriched mu-calculi","authors":"A Piero, Carsten Bonatti, Aniello Lutz, Moshe Y Murano, Vardi","year":"2008","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bourhis et al., 2014] Pierre Bourhis, Markus Krötzsch, and Sebastian Rudolph. How to best nest regular path queries. In Proc. 27th Int. Workshop on Description Logics (DL'14), volume 1193 of CEUR Workshop Proceedings, pages 404-415. CEUR-WS.org, 2014.","title":"How to best nest regular path queries","authors":"Bourhis","year":"2014","venue":"Proc. 27th Int. Workshop on Description Logics (DL'14)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bourhis et al., 2015] Pierre Bourhis, Markus Krötzsch, and Sebastian Rudolph. Reasonable highly expressive query languages. In Qiang Yang and Michael Wooldridge, ed- itors, Proc. 24th Int. Joint Conf. on Artificial Intelligence (IJCAI'15), pages 2826-2832. AAAI Press, 2015.","title":"Reasonable highly expressive query languages","authors":"Bourhis","year":"2015","venue":"Proc. 24th Int. Joint Conf. on Artificial Intelligence (IJCAI'15)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calvanese et al., 2007] Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Answering regular path queries in expressive description logics: An automata-theoretic ap- proach. In Proc. 22nd AAAI Conf. on Artificial Intelligence (AAAI'07), pages 391-396. AAAI Press, 2007.","title":"Answering regular path queries in expressive description logics: An automata-theoretic approach","authors":"Calvanese","year":"2007","venue":"Proc. 22nd AAAI Conf. on Artificial Intelligence (AAAI'07)","doi":null,"url":null,"internal_url":null},{"position":6,"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, Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJ- CAI'09), pages 714-720. IJCAI, 2009.","title":"Regular path queries in expressive description logics with nominals","authors":"Calvanese","year":"2009","venue":"Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJ-CAI'09)","doi":null,"url":null,"internal_url":"/proceedings/2009/124"},{"position":7,"raw":"[Lutz, 2008] Carsten Lutz. The complexity of conjunc- tive query answering in expressive description logics. In Alessandro Armando, Peter Baumgartner, and Gilles Dowek, editors, Proc. 4th Int. Joint Conf. on Automated Reasoning (IJCAR'08), number 5195 in LNAI, pages 179- 193. Springer, 2008.","title":"The complexity of conjunctive query answering in expressive description logics","authors":"Carsten Lutz","year":"2008","venue":"Proc. 4th Int. Joint Conf. on Automated Reasoning (IJCAR'08), number 5195 in LNAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ortiz and Simkus, 2012] Magdalena Ortiz and Mantas Simkus. Reasoning and query answering in description logics. In Thomas Eiter and Thomas Krennwallner, editors, Proc. 8th Int. Reasoning Web Summer School (RW'12), 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":"Proc. 8th Int. Reasoning Web Summer School (RW'12)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ortiz et al., 2010] Magdalena Ortiz, Sebastian Rudolph, and Mantas Simkus. Query answering is undecidable in DLs with regular expressions, inverses, nominals, and counting. INFSYS Research Report 1843-10-03, TU Vi- enna, 2010.","title":"Query answering is undecidable in DLs with regular expressions, inverses, nominals, and counting","authors":"Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pratt-Hartmann, 2007] Ian Pratt-Hartmann. Complexity of the guarded two-variable fragment with counting quanti- fiers. J. Log. Comput., 17(1):133-155, 2007.","title":"Complexity of the guarded two-variable fragment with counting quantifiers","authors":"Ian Pratt-Hartmann","year":"2007","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Pratt-Hartmann, 2009] Ian Pratt-Hartmann. Data- complexity of the two-variable fragment with counting quantifiers. Inf. Comput., 207(8):867-888, 2009.","title":"Datacomplexity of the two-variable fragment with counting quantifiers","authors":"Ian Pratt-Hartmann","year":"2009","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Reutter et al., 2017] Juan L. Reutter, Miguel Romero, and Moshe Y. Vardi. Regular queries on graph databases. Theor. Comp. Sys., 61(1):31-83, July 2017.","title":"Regular queries on graph databases","authors":"Reutter","year":"2017","venue":"Theor. Comp. Sys","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Rudolph and Krötzsch, 2013] Sebastian Rudolph and Markus Krötzsch. Flag & check: Data access with monadically defined queries. In Richard Hull and Wenfei Fan, editors, Proc. 32nd Symposium on Principles of Database Systems (PODS'13), pages 151-162. ACM, 2013.","title":"Flag & check: Data access with monadically defined queries","authors":"Rudolph, Krötzsch, Sebastian Rudolph, Markus Krötzsch","year":"2013","venue":"Proc. 32nd Symposium on Principles of Database Systems (PODS'13)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Rudolph, 2016] Sebastian Rudolph. Undecidability Results for Database-Inspired Reasoning Problems in Very Ex- pressive Description Logics. In Chitta Baral, James P. Del- grande, and Frank Wolter, editors, Proc. 15th Int. Conf. on Knowledge Representation and Reasoning (KR'16), 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":"Proc. 15th Int. Conf. on Knowledge Representation and Reasoning (KR'16)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}