当前位置: X-MOL 学术Semant. Web › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
UCQ-Rewritings for disjunctive knowledge and queries with negated atoms
Semantic Web ( IF 3 ) Pub Date : 2020-10-02 , DOI: 10.3233/sw-200399
Enrique Matos Alfonso 1 , Alexandros Chortaras 1 , Giorgos Stamou 1
Affiliation  

In this paper, we study the problem of query rewriting for disjunctive existential rules. Query rewriting is a well-known approach for query answering on knowledge bases with incomplete data. We propose a rewriting technique that uses negative constraints and conjunctive queries to remove the disjunctive components of disjunctive existential rules. This process eventually generates new non-disjunctive rules, i.e., existential rules. The generated rules can then be used to produce new rewritings using existing rewriting approaches for existential rules. With the proposed technique we are able to provide complete UCQ-rewritings for union of conjunctive queries with universally quantified negation. We implemented the proposed algorithm in the Completo system and performed experiments that evaluate the viability of the proposed solution.

中文翻译:

UCQ-重写,用于否定原子的析取知识和查询

在本文中,我们研究了析取存在规则的查询重写问题。查询重写是一种众所周知的方法,用于基于不完整数据的知识库进行查询回答。我们提出了一种重写技术,该技术使用否定约束和联合查询来删除析取存在规则的析取成分。该过程最终生成新的非析构规则,即存在性规则。然后,可以使用已存在的规则的现有重写方法,将生成的规则用于产生新的重写。通过提出的技术,我们能够为带有通用量化否定的联合查询联合提供完整的UCQ重写。我们在Completo系统中实现了所提出的算法,并进行了评估所提出解决方案可行性的实验。
更新日期:2020-10-04
down
wechat
bug