Soundness preserving approximation for TBox reasoning in R

Yuan Ren, Jeff Z. Pan, Yuting Zhao

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ExpTime-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ExpTime-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL+ with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning inR and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalCEUR Workshop Proceedings
Volume477
Publication statusPublished - 1 Jan 2009
Event22nd International Workshop on Description Logics, DL 2009 - Oxford, United Kingdom
Duration: 27 Jul 200930 Jul 2009
http://www.cs.ox.ac.uk/DL2009/ (Link to Official Website)

Fingerprint

Ontology
Testing

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Soundness preserving approximation for TBox reasoning in R. / Ren, Yuan; Pan, Jeff Z.; Zhao, Yuting.

In: CEUR Workshop Proceedings, Vol. 477, 01.01.2009, p. 1-13.

Research output: Contribution to journalConference article

@article{620d77a20c604e5ca70ad5fa0f431228,
title = "Soundness preserving approximation for TBox reasoning in R",
abstract = "TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ExpTime-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ExpTime-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL+ with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning inR and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.",
author = "Yuan Ren and Pan, {Jeff Z.} and Yuting Zhao",
note = "This work has been partially supported by the European Project Marrying Ontologies and Software Technologies (MOST ICT 2008-216691).",
year = "2009",
month = "1",
day = "1",
language = "English",
volume = "477",
pages = "1--13",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Soundness preserving approximation for TBox reasoning in R

AU - Ren, Yuan

AU - Pan, Jeff Z.

AU - Zhao, Yuting

N1 - This work has been partially supported by the European Project Marrying Ontologies and Software Technologies (MOST ICT 2008-216691).

PY - 2009/1/1

Y1 - 2009/1/1

N2 - TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ExpTime-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ExpTime-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL+ with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning inR and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.

AB - TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ExpTime-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ExpTime-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL+ with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning inR and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.

UR - http://www.scopus.com/inward/record.url?scp=84872913842&partnerID=8YFLogxK

M3 - Conference article

VL - 477

SP - 1

EP - 13

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -