AI Chat AI Image Generator AI Video Text to Speech

Handling owl:sameAs via Rewriting

11/13/2014

∙

by Boris Motik, et al.

∙

∙

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.

Boris Motik
20 publications
Yavor Nenov
4 publications
Robert Piro
1 publication
Ian Horrocks
38 publications

page 1

page 2

page 3

page 4

research

∙ 05/11/2023

Enhancing Datalog Reasoning with Hypertree Decompositions

Datalog reasoning based on the seminaïve evaluation strategy evaluates r...

0 Xinyue Zhang, et al. ∙

research

∙ 03/06/2023

Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning

Program logics for bug-finding (such as the recently introduced Incorrec...

0 Noam Zilberstein, et al. ∙

research

∙ 02/01/2019

StaTIX - Statistical Type Inference on Linked Data

Large knowledge bases typically contain data adhering to various schemas...

0 Artem Lutov, et al. ∙

research

∙ 05/29/2017

Deep Learning for Ontology Reasoning

In this work, we present a novel approach to ontology reasoning that is ...

0 Patrick Hohenecker, et al. ∙

research

∙ 01/15/2014

Asynchronous Forward Bounding for Distributed COPs

A new search algorithm for solving distributed constraint optimization p...

0 Amir Gershman, et al. ∙

research

∙ 12/02/2018

Verifying Fairness Properties via Concentration

As machine learning systems are increasingly used to make real world leg...

0 Osbert Bastani, et al. ∙

research

∙ 03/13/2023

Multilevel Skeletonization Using Local Separators

In this paper we give a new, efficient algorithm for computing curve ske...

0 J. Andreas Bærentzen, et al. ∙