In this paper, we explore conjunctive query rewriting, focusing on queries containing universally quantified negation within the framework of disjunctive existential rules. We address the undecidability of the existence of a finite and complete UCQ-rewriting and the identification of finite unification sets (fus) of rules. We introduce new rule classes, connected linear rules and connected domain restricted rules, that exhibit the fus property for existential rules. Additionally, we propose disconnected disjunction for disjunctive existential rules to achieve the fus property when we extend the introduced rule fragments to disjunctive existential rules. We present ECOMPLETO, a system for efficient query rewriting with disjunctive existential rules, capable of handling UCQs with universally quantified negation. Our experiments demonstrate ECOMPLETO's consistent ability to produce finite UCQ-rewritings and describe the performance on different ontologies and queries.

翻译：本文探讨了析取存在规则框架下包含全称量词否定的合取查询重写问题。我们针对有限且完备的UCQ重写存在性的不可判定性，以及规则有限合一集（fus）的识别问题展开研究。提出了新的规则类——连通线性规则和连通域受限规则，这些规则类在存在规则中表现出fus性质。此外，针对析取存在规则引入非连通析取机制，使得当我们将所提出的规则片段扩展至析取存在规则时，能保持fus性质。我们提出了ECOMPLETO系统，该系统可高效处理带析取存在规则的查询重写，能处理包含全称量词否定的UCQ。实验表明，ECOMPLETO能持续生成有限UCQ重写，并描述了其在不同本体与查询上的性能表现。