Reasonable Highly Expressive Query Languages - IJCAI-15 Distinguished Paper (Honorary Mention)

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]  Michael Benedikt,et al.  Monadic Datalog Containment , 2012, ICALP.

[2]  Federica Mandreoli,et al.  Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data , 2016, Journal of computer and system sciences (Print).

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

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

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

[6]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

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

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

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

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

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

[12]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

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

[14]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[15]  A. Meyer.  Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities , 1974 .

[16]  Editors , 2003 .

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

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

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

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

[21]  Thomas Schwentick,et al.  Optimizing Conjunctive Queries over Trees Using Schema Information , 2008, MFCS.

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

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

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

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

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

[27]  Carsten Lutz,et al.  Ontology-Based Data Access , 2014, ACM Trans. Database Syst..

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