Ahmetaj Shqiponja
Institute of Logic and Computation, TU Wien, Vienna, Austria.
Kunstliche Intell (Oldenbourg). 2020;34(4):523-526. doi: 10.1007/s13218-020-00671-w. Epub 2020 Jun 11.
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.
在基于本体的数据访问(OBDA)中,一种非常有前景的回答查询的方法是通过查询重写。在本文中,我们针对OBDA的几种扩展提出了新颖的重写方法。目标是了解它们的相对表达能力,并为高效的查询回答算法铺平道路。