Conjunctive Regular Path Queries in Lightweight Description Logics

Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive queries and have been extensively studied in the database community. Somewhat surprisingly, there has been little work aimed at using such queries in the context of description logic (DL) knowledge bases, and all existing results target expressive DLs, even though lightweight DLs are considered better-suited for data-intensive applications. This paper aims to bridge this gap by providing algorithms and tight complexity bounds for answering two-way conjunctive regular path queries over DL knowledge bases formulated in lightweight DLs of the DL-Lite and EL families.

[1]  Carsten Lutz,et al.  Data Complexity in the EL Family of Description Logics , 2007, LPAR.

[2]  Sebastian Rudolph,et al.  Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ , 2011, IJCAI.

[3]  Riccardo Rosati,et al.  On Conjunctive Query Answering in EL , 2007, Description Logics.

[4]  Carlos A. Hurtado,et al.  Edinburgh Research Explorer Expressive Languages for Path Queries over Graph-Structured Data , 2012 .

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

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

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

[8]  Thomas Eiter,et al.  Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.

[9]  Sebastian Rudolph,et al.  Conjunctive Queries for EL with Composition of Roles , 2007, Description Logics.

[10]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[11]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[12]  Marcelo Arenas,et al.  nSPARQL: A Navigational Language for RDF , 2008, SEMWEB.

[13]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[14]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[15]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

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