{"type":"ScholarlyArticle","title":"On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles","authors":[{"name":"Tomasz Gogacz","slug":"tomasz-gogacz","given":"Tomasz","family":"Gogacz","affiliation":"University of Warsaw , Poland"},{"name":"Víctor Gutiérrez-Basulto","slug":"victor-gutierrez-basulto","given":"Víctor","family":"Gutiérrez-Basulto","affiliation":"Cardiff University , UK"},{"name":"Yazmín Ibáñez-García","slug":"yazmin-ibanez-garcia","given":"Yazmín","family":"Ibáñez-García","affiliation":"Cardiff University , UK"},{"name":"Jean Christoph Jung","slug":"jean-christoph-jung","given":"Jean Christoph","family":"Jung","affiliation":"University of Bremen , Germany"},{"name":"Filip Murlak","slug":"filip-murlak","given":"Filip","family":"Murlak","affiliation":"University of Warsaw , Poland"}],"abstract":"We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for unrestricted entailment of regular path queries for both extensions and finite entailment of positive existential queries for nominals. For inverses, we establish 2EXPTIME-completeness for unrestricted and finite entailment of instance queries (the latter under restriction to a single, transitive role).","doi":"10.24963/ijcai.2019/238","url":"https://ijcai.org/proceedings/2019/238","pdf":"https://ijcai.org/proceedings/2019/0238.pdf","markdown":"https://ijcai.org/proceedings/2019/238.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/238","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":238,"pages":{"first":1719,"last":1725},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Amarilli and Benedikt, 2015] Antoine Amarilli and Michael Benedikt. Finite open-world query answering with number restrictions. In LICS-15, pages 305-316, 2015.","title":"Finite open-world query answering with number restrictions","authors":"Benedikt Amarilli, Antoine Amarilli, Michael Benedikt","year":"2015","venue":"LICS-15","doi":null,"url":null,"internal_url":null},{"position":2,"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":3,"raw":"[Bednarczyk et al., 2019] Bartosz Bednarczyk, Emanuel Kieronski, and Piotr Witkowski. On the complexity of graded modal logics with converse. In JELIA, volume 11468 of LNCS, pages 642-658, 2019.","title":"On the complexity of graded modal logics with converse","authors":"Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski","year":"2019","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bienvenu and Ortiz, 2015] Meghyn Bienvenu and Mag- dalena Ortiz. Ontology-mediated query answering with data-tractable description logics. In Proc. of RW-15, 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":"Proc. of RW-15","doi":null,"url":null,"internal_url":null},{"position":5,"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":6,"raw":"[Chandra et al., 1981] Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28:114-133, 1981.","title":"Alternation","authors":"K Ashok, Dexter C Chandra, Larry J Kozen, Stockmeyer","year":"1981","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Danielski and Kieronski, 2018] Daniel Danielski and Emanuel Kieronski. Finite satisfiability of unary negation fragment with transitivity. arXiv:1809.03245, 2018.","title":"Finite satisfiability of unary negation fragment with transitivity","authors":"Daniel Danielski, Emanuel Kieronski","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Glimm et al., 2008a] Birte Glimm, Ian Horrocks, and Ul- rike Sattler. Unions of conjunctive queries in SHOQ. In Proc. of KR-08, pages 252-262, 2008.","title":"Unions of conjunctive queries in SHOQ","authors":"Glimm","year":"2008","venue":"Proc. of KR-08","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Glimm et al., 2008b] Birte Glimm, Carsten Lutz, Ian Hor- rocks, and Ulrike Sattler. Conjunctive query answering for the description logic SHIQ. J. Artif. Intell. Res. (JAIR), 31:157-204, 2008.","title":"Conjunctive query answering for the description logic SHIQ","authors":"Glimm","year":"2008","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":"/proceedings/2007/62"},{"position":10,"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":11,"raw":"[Grädel and Walukiewicz, 1999] Erich Grädel and Igor Walukiewicz. Guarded fixed point logic. In Proc. of LICS-99, pages 45-54, 1999.","title":"Erich Grädel and Igor Walukiewicz. Guarded fixed point logic","authors":"Walukiewicz Grädel","year":"1999","venue":"Proc. of LICS-99","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Grädel et al., 2002] Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS, 2002.","title":"Automata, Logics, and Infinite Games: A Guide to Current Research","authors":"Grädel","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gutiérrez-Basulto et al., 2017] Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, and Jean Christoph Jung. Number restrictions on transitive roles in description logics with nominals. In Proc. of AAAI-17, 2017.","title":"Number restrictions on transitive roles in description logics with nominals","authors":"Gutiérrez-Basulto","year":"2017","venue":"Proc. of AAAI-17","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gutiérrez-Basulto et al., 2018] Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, and Jean Christoph Jung. Answer- ing regular path queries over sq ontologies. In Proc. of AAAI-18. AAAI Press, 2018.","title":"Answering regular path queries over sq ontologies","authors":"Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Jean Christoph, Jung","year":"2018","venue":"Proc. of AAAI-18","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ibáñez-García et al., 2014] Yazmin Ibáñez-García, Carsten Lutz, and Thomas Schneider. Finite model reasoning in horn description logics. In Proc. of KR-14, 2014.","title":"Finite model reasoning in horn description logics","authors":"Yazmin Ibáñez-García, Carsten Lutz, Thomas Schneider","year":"2014","venue":"Proc. of KR-14","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kaminski and Smolka, 2010] Mark Kaminski and Gert Smolka. Terminating tableaux for SOQ with number re- strictions on transitive roles. In Proc. of the 6th IFIP TC, pages 213-228, 2010.","title":"Terminating tableaux for SOQ with number restrictions on transitive roles","authors":"Mark Kaminski, Gert Smolka","year":"2010","venue":"Proc. of the 6th IFIP TC","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kazakov and Pratt-Hartmann, 2009] Yevgeny Kazakov and Ian Pratt-Hartmann. A note on the complexity of the sat- isfiability problem for graded modal logics. In Proc. of LICS-09, pages 407-416, 2009.","title":"A note on the complexity of the satisfiability problem for graded modal logics","authors":"Pratt-Hartmann ; Kazakov, Yevgeny Kazakov, Ian Pratt-Hartmann","year":"2009","venue":"Proc. of LICS-09","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kazakov et al., 2007] Yevgeny Kazakov, Ulrike Sattler, and Evgeny Zolin. How many legs do I have? Non-simple roles in number restrictions revisited. In Proc. of LPAR- 07, pages 303-317, 2007.","title":"How many legs do I have? Non-simple roles in number restrictions revisited","authors":"Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin","year":"2007","venue":"Proc. of LPAR-07","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kontchakov and Zakharyaschev, 2014] Roman Kontchakov and Michael Zakharyaschev. An introduction to descrip- tion logics and query rewriting. In Proc. of RW-14, pages 195-244, 2014.","title":"Roman Kontchakov and Michael Zakharyaschev. An introduction to description logics and query rewriting","authors":"Zakharyaschev Kontchakov","year":"2014","venue":"Proc. of RW-14","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lutz, 2008] Carsten Lutz. The complexity of conjunctive query answering in expressive description logics. In Pro- ceedings of IJCAR 2008, pages 179-193, 2008.","title":"The complexity of conjunctive query answering in expressive description logics","authors":"Carsten Lutz","year":"2008","venue":"Proceedings of IJCAR 2008","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Ngo et al., 2016] Nhung Ngo, Magdalena Ortiz, and Man- tas Simkus. Closed predicates in description logics: Re- sults on combined complexity. In Proc. of KR-16, pages 237-246, 2016.","title":"Closed predicates in description logics: Results on combined complexity","authors":"Nhung Ngo, Magdalena Ortiz, Mantas Simkus","year":"2016","venue":"Proc. of KR-16","doi":null,"url":null,"internal_url":null},{"position":22,"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":23,"raw":"[Rosati, 2008] Riccardo Rosati. Finite model reasoning in dl-lite. In Proc. of ESWC-19, pages 215-229, 2008.","title":"Finite model reasoning in dl-lite","authors":"Riccardo Rosati","year":"2008","venue":"Proc. of ESWC-19","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rudolph, 2016] Sebastian Rudolph. Undecidability results for database-inspired reasoning problems in very expres- sive description logics. In Proc. of KR-16, pages 247-257, 2016.","title":"Undecidability results for database-inspired reasoning problems in very expressive description logics","authors":"Rudolph ;, Sebastian Rudolph","year":"2016","venue":"Proc. of KR-16","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}