Handling owl:sameAs via Rewriting
Boris Motik, Yavor Nenov, Robert Piro, Ian Horrocks
TL;DR
This paper introduces a new rewriting algorithm for owl:sameAs reasoning in OWL 2 RL systems that guarantees correctness, enhances efficiency, and significantly reduces reasoning times on practical datasets.
Contribution
The paper presents a novel rewriting algorithm that ensures correctness and improves efficiency for owl:sameAs reasoning, with effective parallelisation capabilities.
Findings
Reduces reasoning times by orders of magnitude on practical datasets
Guarantees correctness of owl:sameAs reasoning during rewriting
Enhances efficiency and supports parallel processing
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Natural Language Processing Techniques · Logic, Reasoning, and Knowledge