Optimizing Heuristics for Tableau-based OWL Reasoners

10/15/2018
by   Razieh Mehri, et al.
0

Optimization techniques play a significant role in improving description logic reasoners covering the Web Ontology Language (OWL). These techniques are essential to speed up these reasoners. Many of the optimization techniques are based on heuristic choices. Optimal heuristic selection makes these techniques more effective. The FaCT++ OWL reasoner and its Java version JFact implement an optimization technique called ToDo list which is a substitute for a traditional top-down approach in tableau-based reasoners. The ToDo list mechanism allows one to arrange the order of applying different rules by giving each a priority. Compared to a top-down approach, the ToDo list technique has a better control over the application of expansion rules. Learning the proper heuristic order for applying rules in ToDo lis will have a great impact on reasoning speed. We use a binary SVM technique to build our learning model. The model can help to choose ontology-specific order sets to speed up OWL reasoning. On average, our learning approach tested with 40 selected ontologies achieves a speedup of two orders of magnitude when compared to the worst rule ordering choice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2019

Learning the Right Expansion-ordering Heuristics for Satisfiability Testing in OWL Reasoners

Web Ontology Language (OWL) reasoners are used to infer new logical rela...
research
05/29/2017

Deep Learning for Ontology Reasoning

In this work, we present a novel approach to ontology reasoning that is ...
research
06/18/2019

A Framework for Parallelizing OWL Classification in Description Logic Reasoners

In this paper we report on a black-box approach to parallelize existing ...
research
07/13/2021

Parallelisable Existential Rules: a Story of Pieces

In this paper, we consider existential rules, an expressive formalism we...
research
10/15/2021

LPRules: Rule Induction in Knowledge Graphs Using Linear Programming

Knowledge graph (KG) completion is a well-studied problem in AI. Rule-ba...
research
07/05/2023

Runtime Repeated Recursion Unfolding: A Just-In-Time Online Program Optimization That Can Achieve Super-Linear Speedup

We introduce a just-in-time runtime program transformation based on repe...

Please sign up or login with your details

Forgot password? Click here to reset