# Handling owl:sameAs via Rewriting

arXiv: https://arxiv.org/abs/1411.3622 · HTML: https://mlsanity.com/paper/1411.3622/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Nov 2014.

## Built on by (most cited first, 2 of 2)

- [Computing CQ lower-bounds over OWL 2 through approximation to RSA](https://mlsanity.com/paper/2107.00369/) (2021)
- [Optimised Storage for Datalog Reasoning](https://mlsanity.com/paper/2312.11297/) (2023)

## 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.