{"type":"ScholarlyArticle","title":"Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention)","authors":[{"name":"Pierre Bourhis","slug":"pierre-bourhis","given":"Pierre","family":"Bourhis","affiliation":"Technische Universität Dresden , Germany"},{"name":"Markus Krötzsch","slug":"markus-krotzsch","given":"Markus","family":"Krötzsch","affiliation":"‡ CNRS CRIStAL UMR 9189"},{"name":"Sebastian Rudolph","slug":"sebastian-rudolph","given":"Sebastian","family":"Rudolph","affiliation":"‡ CNRS CRIStAL UMR 9189"}],"abstract":"Expressive query languages are gaining relevance in knowledge representation (KR), and new reasoning problems come to the fore. Especially query containment is interesting in this context. The problem is known to be decidable for many expressive query languages, but exact complexities are often missing. We introduce a new query language, guarded queries (GQ), which generalizes most known languages where query containment is decidable. GQs can be nested (more expressive), or restricted to linear recursion (less expressive). Our comprehensive analysis of the computational properties and expressiveness of (linear/nested) GQs also yields insights on many previous languages.","doi":null,"url":"https://ijcai.org/proceedings/2015/400","pdf":"https://ijcai.org/proceedings/2015/0400.pdf","markdown":"https://ijcai.org/proceedings/2015/400.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/400","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Special Track on Knowledge Representation and Reasoning","track":"Special Track on Knowledge Representation and Reasoning","number":400,"pages":{"first":2826,"last":2831},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Abiteboul and Vianu, 1999] Serge Abiteboul and Victor Vianu. Regular path queries with constraints. J. Comput. Syst. Sci., 58(3):428-452, 1999.","title":"Regular path queries with constraints","authors":"Serge Abiteboul, Victor Vianu","year":"1999","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Abiteboul et al., 1994] Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison Wesley, 1994.","title":"Foundations of Databases","authors":"Serge Abiteboul, Richard Hull, Victor Vianu","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baget et al., 2011] Jean-François Baget, Michel Leclère, Marie- Laure Mugnier, and Eric Salvat. On rules with existential vari- ables: Walking the decidability line. Artificial Intelligence, 175(9-10):1620-1654, 2011.","title":"On rules with existential variables: Walking the decidability line","authors":"Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bárány et al., 2011] Vince Bárány, Balder ten Cate, and Luc Segoufin. Guarded negation. In Luca Aceto, Monika Henzinger, and Jiri Sgall, editors, ICALP (2), volume 6756 of LNCS, pages 356-367. Springer, 2011.","title":"Guarded negation","authors":"Vince Bárány, Luc Balder Ten Cate, Segoufin","year":"2011","venue":"ICALP (2)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bárány et al., 2012] Vince Bárány, Balder ten Cate, and Martin Otto. Queries with guarded negation. PVLDB, 5(11):1328-1339, 2012.","title":"Queries with guarded negation","authors":"Vince Bárány, Martin Balder Ten Cate, Otto","year":"2012","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Benedikt et al., 2012] Michael Benedikt, Pierre Bourhis, and Pierre Senellart. Monadic datalog containment. In Proc. 39th Int. Coll. on Automata, Languages, and Programming (ICALP'12), pages 79-91, 2012.","title":"Monadic datalog containment","authors":"Michael Benedikt, Pierre Bourhis, Pierre Senellart","year":"2012","venue":"Proc. 39th Int. Coll. on Automata, Languages, and Programming (ICALP'12)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bienvenu et al., 2013] Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP. In Richard Hull and Wenfei Fan, editors, Proc. 32nd Symp. on Principles of Database Systems (PODS'13), pages 213-224. ACM, 2013.","title":"Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP","authors":"Bienvenu","year":"2013","venue":"Proc. 32nd Symp. on Principles of Database Systems (PODS'13)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bienvenu et al., 2014] Meghyn Bienvenu, Diego Calvanese, Mag- dalena 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 Reasoning (KR'14). 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":9,"raw":"[Bischoff et al., 2014] Stefan Bischoff, Markus Krötzsch, Axel Polleres, and Sebastian Rudolph. Schema-agnostic query rewrit- ing for SPARQL 1.1. In Peter Mika, Tania Tudorache, Abra- ham Bernstein, Chris Welty, Craig A. Knoblock, Denny Vran- dečić, Paul T. Groth, Natasha F. Noy, Krzysztof Janowicz, and Carole A. Goble, editors, Proc. 13th Int. Semantic Web Conf. (ISWC'14), volume 8796 of LNCS, pages 584-600. Springer, 2014.","title":"Schema-agnostic query rewriting for SPARQL 1.1","authors":"Stefan Bischoff, Markus Krötzsch, Axel Polleres, Sebastian Rudolph","year":"2014","venue":"Proc. 13th Int. Semantic Web Conf. (ISWC'14)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bourhis et al., 2015] Pierre Bourhis, Markus Krötzsch, and Sebas- tian Rudolph. Reasonable highly expressive query languages: Extended technical report. Available at https://ddll.inf. tu-dresden.de/web/Techreport3020, 2015.","title":"Reasonable highly expressive query languages: Extended technical report","authors":"Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph","year":"2015","venue":null,"doi":null,"url":"https://ddll.inf.tu-dresden.de/web/Techreport3020","internal_url":null},{"position":11,"raw":"[Calì et al., 2008] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive re- lational constraints. In Gerhard Brewka and Jérôme Lang, edi- tors, Proc. 11th Int. Conf. on Principles of Knowledge Represen- tation and Reasoning (KR'08), pages 70-80. AAAI Press, 2008.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2008","venue":"Proc. 11th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'08)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calvanese et al., 2003] Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Reasoning on regular path queries. SIGMOD Record, 32(4):83-92, 2003.","title":"Reasoning on regular path queries","authors":"Calvanese","year":"2003","venue":"SIGMOD Record","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Calvanese et al., 2005] Diego Calvanese, Giuseppe De Giacomo, and Moshe Y. Vardi. Decidable containment of recursive queries. Theor. Comput. Sci., 336(1):33-56, 2005.","title":"Decidable containment of recursive queries","authors":"Calvanese","year":"2005","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Calvanese et al., 2007a] Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Answering regular path queries in expressive description logics: An automata-theoretic approach. 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":15,"raw":"[Calvanese et al., 2007b] Diego Calvanese, Guiseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in descrip- tion logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385-429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Calvanese et al., 2009] Diego Calvanese, Thomas Eiter, and Mag- dalena Ortiz. Regular path queries in expressive description log- ics with nominals. In Craig Boutilier, editor, Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09), pages 714-720.","title":"Regular path queries in expressive description logics with nominals","authors":"Calvanese","year":"2009","venue":"Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09)","doi":null,"url":null,"internal_url":"/proceedings/2009/124"},{"position":17,"raw":"IJ- CAI, 2009.","title":null,"authors":"Ij-Cai","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Chaudhuri and Vardi, 1994] Surajit Chaudhuri and Moshe Y. Vardi. On the complexity of equivalence between recursive and nonrecursive Datalog programs. In Proc. 13th Symp. on Princi- ples of Database Systems (PODS'93), pages 107-116, 1994.","title":"On the complexity of equivalence between recursive and nonrecursive Datalog programs","authors":"Surajit Chaudhuri, Moshe Y Vardi","year":"1994","venue":"Proc. 13th Symp. on Principles of Database Systems (PODS'93)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Chaudhuri and Vardi, 1997] Surajit Chaudhuri and Moshe Y. Vardi. On the equivalence of recursive and nonrecursive Data- log programs. J. of Comput. Syst. Sci., 54(1):61-78, 1997.","title":"On the equivalence of recursive and nonrecursive Datalog programs","authors":"Surajit Chaudhuri, Moshe Y Vardi","year":"1997","venue":"J. of Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Cosmadakis et al., 1988] Stavros Cosmadakis, Haim Gaifman, Paris Kanellakis, and Moshe Vardi. Decidable optimization problems for database logic programs. In Proc. 20th Annual ACM Symp. on Theory of Computing (STOC'88), pages 477-490. ACM, 1988.","title":"Decidable optimization problems for database logic programs","authors":"Stavros Cosmadakis, Haim Gaifman, Paris Kanellakis, Moshe Vardi","year":"1988","venue":"Proc. 20th Annual ACM Symp. on Theory of Computing (STOC'88)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Courcelle, 1991] Bruno Courcelle. Recursive queries and context- free graph grammars. Theor. Comput. Sci., 78(1):217-244, 1991.","title":"Recursive queries and contextfree graph grammars","authors":"Bruno Courcelle, Courcelle","year":"1991","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Deutsch and Tannen, 2002] Alin Deutsch and Val Tannen. Op- timization properties for classes of conjunctive regular path queries. In Revised Papers from the 8th Int. Workshop on Database Programming Languages (DBPL'01), pages 21-39. Springer, 2002.","title":"Optimization properties for classes of conjunctive regular path queries","authors":"Alin Deutsch, Val Tannen","year":"2002","venue":"Revised Papers from the 8th Int. Workshop on Database Programming Languages (DBPL'01)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Eiter et al., 2009] Thomas Eiter, Carsten Lutz, Magdalena Ortiz, and Mantas Simkus. Query answering in description logics with transitive roles. In Craig Boutilier, editor, Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09), pages 759-764.","title":"Query answering in description logics with transitive roles","authors":"Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Mantas Simkus","year":null,"venue":"Proc. 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09)","doi":null,"url":null,"internal_url":"/proceedings/2009/131"},{"position":24,"raw":"IJ- CAI, 2009.","title":null,"authors":"Ij-Cai","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Florescu et al., 1998] Daniela Florescu, Alon Levy, and Dan Su- ciu. Query containment for conjunctive queries with regular ex- pressions. In Alberto O. Mendelzon and Jan Paredaens, editors, Proc. 17th Symp. on Principles of Database Systems (PODS'98), pages 139-148. ACM, 1998.","title":"Query containment for conjunctive queries with regular expressions","authors":"Daniela Florescu, Alon Levy, Dan Suciu","year":"1998","venue":"Proc. 17th Symp. on Principles of Database Systems (PODS'98)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Krötzsch, 2011] Markus Krötzsch. Efficient rule-based inferenc- ing for OWL EL. In Toby Walsh, editor, Proc. 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI'11), pages 2668-2673. AAAI Press/IJCAI, 2011.","title":"Efficient rule-based inferencing for OWL EL","authors":"Markus Krötzsch","year":"2011","venue":"Proc. 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI'11)","doi":null,"url":null,"internal_url":"/proceedings/2011/444"},{"position":27,"raw":"[Reutter, 2013] Juan L. Reutter. Containment of nested regular ex- pressions. CoRR, abs/1304.2637, 2013.","title":"Containment of nested regular expressions","authors":"Juan L Reutter","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"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 Symp. 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 Symp. on Principles of Database Systems (PODS'13)","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Shmueli, 1987] O. Shmueli. Decidability and expressiveness as- pects of logic queries. In Proc. 6th Symp. on Principles of Database Systems (PODS'87), pages 237-249. ACM, 1987.","title":"Decidability and expressiveness aspects of logic queries","authors":"O Shmueli","year":"1987","venue":"Proc. 6th Symp. on Principles of Database Systems (PODS'87)","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Xiao et al., 2010] Guohui Xiao, Stijn Heymans, and Thomas Eiter. DReW: a reasoner for Datalog-rewritable description logics and dl-programs. In Thomas Eiter, Adil El Ghali, Sergio Fernández, Stijn Heymans, Thomas Krennwallner, and François Lévy, edi- tors, Proc. 1st Int. Workshop on Business Models, Business Rules and Ontologies (BuRO'10), pages 1-14. ONTORULE Project, 2010.","title":"DReW: a reasoner for Datalog-rewritable description logics and dl-programs","authors":"Guohui Xiao, Stijn Heymans, Thomas Eiter","year":"2010","venue":"Proc. 1st Int. Workshop on Business Models, Business Rules and Ontologies (BuRO'10)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}