Compiling Model Representations for Querying Large ABoxes in Expressive DLs

Answering ontology mediated queries (OMQs) has received much attention in the last decade, but the big gap between practicable algorithms for lightweight ontologies, that are supported by implemented reasoners, and purely theoretical algorithms for expressive ontologies that are not amenable to implementation, has only increased. Towards narrowing the gap, we propose an algorithm to compile a representation of sets of models for ALCHI ontologies, which is sufficient for answering any monotone query. Rather than reasoning for specific ABoxes, or being fully dataindependent, we use generic descriptions of families of ABoxes, given by what we call profiles. Our model compilation algorithm runs on TBoxes and sets of profiles, and supports the incremental addition of new profiles. To illustrate the potential of our approach for OMQ answering, we implement a rewriting into an extension of Datalog for OMQs comprising reachability queries, and provide some promising evaluation results.

[1]  Diego Calvanese,et al.  Answering regular path queries in expressive Description Logics via alternating tree-automata , 2014, Inf. Comput..

[2]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[3]  Egor V. Kostylev,et al.  Queries with negation and inequalities over lightweight ontologies , 2015, J. Web Semant..

[4]  Birte Glimm,et al.  Konclude: System description , 2014, J. Web Semant..

[5]  Boris Motik,et al.  The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases , 2014, J. Artif. Intell. Res..

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

[7]  Diego Calvanese,et al.  The description logic handbook: theory , 2003 .

[8]  Michael Zakharyaschev,et al.  Ontology-Based Data Access: Ontop of Databases , 2013, SEMWEB.

[9]  Boris Motik,et al.  Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..

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

[11]  Magdalena Ortiz,et al.  Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming , 2017, Description Logics.

[12]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[13]  Boris Motik,et al.  A Decomposition Rule for Decision Procedures by Resolution-Based Calculi , 2005, LPAR.

[14]  Boris Motik,et al.  HermiT: An OWL 2 Reasoner , 2014, Journal of Automated Reasoning.

[15]  Magdalena Ortiz,et al.  Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms , 2015, J. Artif. Intell. Res..

[16]  Diego Calvanese,et al.  DL-Lite: Tractable Description Logics for Ontologies , 2005, AAAI.