Reasonable highly expressive query languages

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.

[1]  Sebastian Rudolph,et al.  Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention) , 2015, IJCAI.

[2]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[3]  Balder ten Cate,et al.  Queries with Guarded Negation , 2012, Proc. VLDB Endow..

[4]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[5]  Markus Krötzsch.  Efficient Rule-Based Inferencing for OWL EL , 2011, IJCAI.

[6]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[7]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[8]  Diego Calvanese,et al.  Regular Path Queries in Expressive Description Logics with Nominals , 2009, IJCAI.

[9]  Alin Deutsch,et al.  Optimization Properties for Classes of Conjunctive Regular Path Queries , 2001, DBPL.

[10]  Surajit Chaudhuri,et al.  On the Equivalence of Recursive and Nonrecursive Datalog Programs , 1997, J. Comput. Syst. Sci..

[11]  Bruno Courcelle,et al.  Recursive Queries and Context-free Graph Grammars , 1991, Theor. Comput. Sci..

[12]  Diego Calvanese,et al.  Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach , 2007, AAAI.

[13]  Juan L. Reutter.  Containment of Nested Regular Expressions , 2013, ArXiv.

[14]  Diego Calvanese,et al.  Decidable containment of recursive queries , 2003, Theor. Comput. Sci..

[15]  Stijn Heymans,et al.  DReW: a Reasoner for Datalog-rewritable Description Logics and DL-Programs , 2010 .

[16]  Serge Abiteboul,et al.  Regular Path Queries with Constraints , 1999, J. Comput. Syst. Sci..

[17]  Surajit Chaudhuri,et al.  On the complexity of equivalence between recursive and nonrecursive Datalog programs , 1994, PODS '94.

[18]  Thomas Eiter,et al.  Query answering in description logics with transitive roles , 2009, IJCAI 2009.

[19]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[20]  Diego Calvanese,et al.  Nested Regular Path Queries in Description Logics , 2014, KR.

[21]  Dan Suciu,et al.  Query containment for conjunctive queries with regular expressions , 1998, PODS.

[22]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[23]  Sebastian Rudolph,et al.  Schema-Agnostic Query Rewriting in SPARQL 1.1 , 2014, International Semantic Web Conference.

[24]  Diego Calvanese,et al.  Reasoning on regular path queries , 2003, SGMD.

[25]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[26]  Michael Benedikt,et al.  Monadic Datalog Containment , 2012, ICALP.

[27]  Sebastian Rudolph,et al.  Flag & check: data access with monadically defined queries , 2013, PODS '13.