Rewriting Approaches for Ontology-Mediated Query Answering

Abstract

A most promising approach to answering queries in ontology-based data access (OBDA) is through query rewriting. In this paper we present novel rewriting approaches for several extensions of OBDA. The goal is to understand their relative expressiveness and to pave the way for efficient query answering algorithms.

Special Issue on Ontologies and Data Management: Part II

“…The PhD thesis abstract [ 11 ] describes Pensel’s contributions to rational reasoning in defeasible description logics. In [ 1 ], Ahmetaj describes her research into query rewriting in ontology-mediated query answering (OMQA), extending previously studied settings with closed predicates, expressive ontology languages, and SPARQL queries. OMQA is also the subject of Sabellek’s PhD thesis, which is summarised in [ 13 ] and studies several reasoning problems related to OMQA in Horn description logics.…”

“… A lightweight defeasible description logic in depth-quantification in rational reasoning and beyond [ 11 ] Maximilian Pensel Rewriting approaches for Ontology-Mediated Query Answering [ 1 ] Shqiponja Ahmetaj Ontology-mediated Querying with Horn Description Logics [ 13 ] Leif Sabellek Defeasible Description Logics [ 16 ] Ivan Varzinczak …”

“…In contrast to DLs, rules are very suitable for expressing various information needs, which is witnessed by their use as query languages for relational databases (DATALOG being the most prominent rule-based query language). For this reason, understanding ways of combining the strengths of DLs and rule-based languages is an active research area, which we touch upon in this part of the special issue [ 1 , 4 , 6 – 9 ]. In contrast to standard rule-based languages, in DLs one usually makes the open-world assumption, which is suitable for constructing generic, reusable, data-independent ontologies.…”