Ontology-Mediated Queries from Examples: a Glimpse at the DL-Lite Case

Reverse engineering queries from given data, as in the case of query-by-example and query definability, is an important problem with many applications that has recently gained attention in the areas where symbolic artificial intelligence meets learning. In the presence of ontologies this problem was recently studied for Horn-ALC and Horn-ALCI. The main contribution of this paper is to take a first look at the case of DL-Lite, to identify cases where the addition of the ontology does not increase the worst-case complexity of the problem. Unfortunately, reverse engineering conjunctive queries is known to be very hard, even for plain databases, since the smallest witness query is known to be exponential in general. In the light of this, we outline some possible research directions for exploiting the ontology in order to obtain smaller witness queries.

[1]  Denis Mayr Lima Martins,et al.  Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities , 2019, Inf. Syst..

[2]  Aurélien Lemay,et al.  Learning Path Queries on Graph Databases , 2015, EDBT.

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

[4]  Frank Neven,et al.  Definability problems for graph query languages , 2013, ICDT '13.

[5]  Balder ten Cate,et al.  The Product Homomorphism Problem and Applications , 2015, ICDT.

[6]  Christopher Ré,et al.  A Relational Framework for Classifier Engineering , 2018, TODS.

[7]  Jörg-Uwe Kietz,et al.  Learnability of Description Logic Programs , 2002, ILP.

[8]  Pablo Barceló,et al.  The complexity of reverse engineering problems for conjunctive queries , 2016, ICDT.

[9]  Diego Calvanese,et al.  Ontology-Based Data Access: A Survey , 2018, IJCAI.

[10]  Moshé M. Zloof.  Query-by-example: the invocation and definition of tables and forms , 1975, VLDB '75.

[11]  Jean Christoph Jung,et al.  Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies , 2018, IJCAI.

[12]  Pablo Barceló,et al.  Regularizing Conjunctive Features for Classification , 2019, PODS.

[13]  Magdalena Ortiz,et al.  Ontology-Mediated Query Answering with Data-Tractable Description Logics , 2015, Reasoning Web.

[14]  Ross Willard.  Testing Expressibility Is Hard , 2010, CP.

[15]  Srinivasan Parthasarathy,et al.  Query reverse engineering , 2014, The VLDB Journal.

[16]  Egor V. Kostylev,et al.  Reverse Engineering SPARQL Queries , 2016, WWW.

[17]  Themis Palpanas,et al.  New Trends on Exploratory Methods for Data Analytics , 2017, Proc. VLDB Endow..

[18]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[19]  Michael Benedikt,et al.  SPARQLByE: Querying RDF data by example , 2016, Proc. VLDB Endow..

[20]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[21]  Laks V. S. Lakshmanan,et al.  FastQRE: Fast Query Reverse Engineering , 2018, SIGMOD Conference.

[22]  David Maier,et al.  Query From Examples: An Iterative, Data-Driven Approach to Query Construction , 2015, Proc. VLDB Endow..

[23]  Magdalena Ortiz,et al.  Reasoning and Query Answering in Description Logics , 2012, Reasoning Web.