Abstract
AbstractA 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.
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Ahmetaj S Rewriting approaches for ontology-mediated query answering. Ph.D. thesis, TU Wien
2. Ahmetaj S, Fischl W, Pichler R, Šimkus M, Skritek S (2015) Towards reconciling SPARQL and certain answers. In: WWW
3. Ahmetaj S, Ortiz M, Simkus M (2020) Polynomial rewritings from expressive description logics with closed predicates to variants of datalog. Artif Intell 280:103220
4. Ahmetaj S, Ortiz M, Šimkus M (2016) Polynomial datalog rewritings for expressive description logics with closed predicates. In: IJCAI
5. Ahmetaj S, Ortiz M, Šimkus M (2018) Rewriting guarded existential rules into small datalog programs. In: ICDT
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献