Handling owl:sameAs via Rewriting
This work improves efficiency for semantic web and knowledge graph applications, but appears incremental as it builds on existing rewriting methods.
The paper tackled the problem of optimizing owl:sameAs reasoning in OWL 2 RL systems by addressing correctness and efficiency issues in rewriting, resulting in an algorithm that reduces reasoning times by orders of magnitude on practical datasets.
Rewriting is widely used to optimise owl:sameAs reasoning in materialisation based OWL 2 RL systems. We investigate issues related to both the correctness and efficiency of rewriting, and present an algorithm that guarantees correctness, improves efficiency, and can be effectively parallelised. Our evaluation shows that our approach can reduce reasoning times on practical data sets by orders of magnitude.