Handling owl:sameAs via Rewriting
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Nov 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2021Computing CQ lower-bounds over OWL 2 through approximation to RSAcited by 0
- 2023Optimised Storage for Datalog Reasoningcited by 0
- 2023Optimised Storage for Datalog Reasoning18 Dec 2023
- 2021Computing CQ lower-bounds over OWL 2 through approximation to RSA1 Jul 2021