Notation3 Logic (\nthree) is an extension of RDF that allows the user to
write rules introducing new blank nodes to RDF graphs. Many applications (e.g.,
ontology mapping) rely on this feature as blank nodes -- used directly or in
auxiliary constructs -- are omnipresent on the Web. However, the number of fast
\nthree reasoners covering this very important feature of the logic is rather
limited. On the other hand, there are engines like VLog or Nemo which do not
directly support Semantic Web rule formats but which are developed and
optimized for very similar constructs: existential rules. In this paper, we
investigate the relation between \nthree rules with blank nodes in their heads
and existential rules. We identify a subset of \nthree which can be mapped
directly to existential rules and define such a mapping preserving the
equivalence of \nthree formulae. In order to also illustrate that in some cases
\nthree reasoning could benefit from our translation, we then employ this
mapping in an implementation to compare the performance of the \nthree
reasoners EYE and cwm to VLog and Nemo on \nthree rules and their mapped
counterparts. Our tests show that the existential rule reasoners perform
particularly well for use cases containing many facts while especially the EYE
reasoner is very fast when dealing with a high number of dependent rules. We
thus provide a tool enabling the Semantic Web community to directly use
existing and future existential rule reasoners and benefit from the findings of
this active community.

Notation3 逻辑（N3）是 RDF 的扩展，允许用户编写引入新的空白节点到 RDF 图中的规则；本文探讨了 N3 规则中带有空白节点的头部与存在规则的关系，并给出了一个等价的映射；研究结果表明存在规则的推理引擎在处理包含大量事实的用例时表现良好，而 EYE 推理引擎在处理大量依赖规则时非常快速。