Notation3 as an Existential Rule Language
share
Notation3 Logic () 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 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 rules with blank nodes in their heads and existential rules. We identify a subset of which can be mapped directly to existential rules and define such a mapping preserving the equivalence of formulae. In order to also illustrate that in some cases reasoning could benefit from our translation, we then employ this mapping in an implementation to compare the performance of the reasoners EYE and cwm to VLog and Nemo on 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.
READ FULL TEXT
