Login | Register

A Machine Learning Approach for Optimizing Heuristic Decision-making in OWL Reasoners

Title:

A Machine Learning Approach for Optimizing Heuristic Decision-making in OWL Reasoners

Mehri-Dehnavi, Razieh (2019) A Machine Learning Approach for Optimizing Heuristic Decision-making in OWL Reasoners. PhD thesis, Concordia University.

[thumbnail of Mehri-Dehnavi_PhD_S2020.pdf]
Preview
Text (application/pdf)
Mehri-Dehnavi_PhD_S2020.pdf - Accepted Version
1MB

Abstract

Description Logics (DLs) are formalisms for representing knowledge bases of application domains. TheWeb Ontology Language (OWL) is a syntactic variant of a very expressive description logic. OWL reasoners can infer implied information from OWL ontologies. The performance of OWL reasoners can be severely affected by situations that require decision-making over many alternatives. Such a non-deterministic behavior is often controlled by heuristics that are based on insufficient information. This thesis proposes a novel OWL reasoning approach that applies machine learning (ML) to implement pragmatic and optimal decision-making strategies in such situations.
Disjunctions occurring in ontologies are one source of non deterministic actions in reasoners. We propose two ML-based approaches to reduce the non-determinism caused by dealing with disjunctions. The first approach is restricted to propositional description logic while the second one can deal with standard description logic.
The first approach builds a logistic regression classifier that chooses a proper branching heuristic for an input ontology. Branching heuristics are first developed to help Propositional Satisfiability (SAT) based solvers with making decisions about which branch to pick in each branching level.
The second approach is the developed version of the first approach. An SVM (Support Vector Machine) classier is designed to select an appropriate expansion-ordering heuristic for an input ontology. The built-in heuristics are designed for expansion ordering of satisfiability testing in OWL reasoners.
They determine the order for branches in search trees.
Both of the above approaches speed up our ML-based reasoner by up to two orders of magnitude in comparison to the non-ML reasoner.
Another source of non-deterministic actions is the order in which tableau rules should be applied. On average, our ML-based approach that is an SVM classifier achieves a speedup of two orders of magnitude when compared to the most expensive rule ordering of the non-ML reasoner.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science
Item Type:Thesis (PhD)
Authors:Mehri-Dehnavi, Razieh
Institution:Concordia University
Degree Name:Ph. D.
Program:Computer Science
Date:November 2019
Thesis Supervisor(s):Haarslev, Volker
ID Code:986333
Deposited By: RAZIEH MEHRI DEHNAVI
Deposited On:25 Jun 2020 18:21
Last Modified:25 Jun 2020 18:21
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top