Query Rewriting for DL-Lite with n-ary Concrete Domains
Query Rewriting for DL-Lite with n-ary Concrete Domains
复制标题
DOI：
10.24963/ijcai.2017/109
复制
发表时间：
2017-08
期刊：
影响因子：
--
通讯作者：
F. Baader;Stefan Borgwardt;M. Lippmann
中科院分区：
文献类型：
--
作者：
F. Baader;Stefan Borgwardt;M. Lippmann
我们调查基于本体的查询回答（OBQA）的设置中，本体和查询可以指具体的值，如数字和字符串。与之前有关此主题的工作相反，用于比较值的内置谓词并不限于一元。我们引入限制这些谓词和本体语言，使我们能够减少OBQA查询回答数据库中使用所谓的组合重写方法。虽然乍一看，我们的限制是不同的，从以前的工作中使用的，我们表明，我们的结果严格subsequently一些现有的一阶可重写的结果为一元谓词。
We investigate ontology-based query answering (OBQA) in a setting where both the ontology and the query can refer to concrete values such as numbers and strings. In contrast to previous work on this topic, the built-in predicates used to compare values are not restricted to being unary. We introduce restrictions on these predicates and on the ontology language that allow us to reduce OBQA to query answering in databases using the so-called combined rewriting approach. Though at first sight our restrictions are different from the ones used in previous work, we show that our results strictly subsume some of the existing first-order rewritability results for unary predicates.