Eliminating concepts and roles from ontologies in expressive descriptive logics

Kewen Wang*, Zhe Wang, Rodney Topor, Jeff Z. Pan, Grigoris Antoniou

*Corresponding author for this work

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

Forgetting is an important tool for reducing ontologies by eliminating some redundant concepts and roles while preserving sound and complete reasoning. Attempts have previously been made to address the problem of forgetting in relatively simple description logics (DLs), such as DL-Lite and extended Eℒ. However, the issue of forgetting for ontologies in more expressive DLs, such as AℒC and OWL DL, is largely unexplored. In particular, the problem of characterizing and computing forgetting for such logics is still open. In this paper, we first define semantic forgetting about concepts and roles in AℒC ontologies and state several important properties of forgetting in this setting. We then define the result of forgetting for concept descriptions in AℒC, state the properties of forgetting for concept descriptions, and present algorithms for computing the result of forgetting for concept descriptions. Unlike the case of DL-Lite, the result of forgetting for an AℒC ontology does not exist in general, even for the special case of forgetting in TBoxes. This makes the problem of computing the result of forgetting in AℒC more challenging. We address this problem by defining a series of approximations to the result of forgetting for AℒC ontologies and studying their properties. Our algorithms for computing approximations can be directly implemented as a plug-in of an ontology editor to enhance its ability of managing and reasoning in (large) ontologies.

Original languageEnglish
Pages (from-to)205-232
Number of pages28
JournalComputational Intelligence
Volume30
Issue number2
Early online date26 Jun 2012
DOIs
Publication statusPublished - 6 May 2014

Fingerprint

Ontology
Description Logics
Logic
Computing
Reasoning
Plug-in
Approximation
Concepts
Semantics
Acoustic waves
Series

Keywords

  • DLs
  • forgetting
  • ontology

ASJC Scopus subject areas

  • Computational Mathematics
  • Artificial Intelligence

Cite this

Eliminating concepts and roles from ontologies in expressive descriptive logics. / Wang, Kewen; Wang, Zhe; Topor, Rodney; Pan, Jeff Z.; Antoniou, Grigoris.

In: Computational Intelligence, Vol. 30, No. 2, 06.05.2014, p. 205-232.

Research output: Contribution to journalArticle

Wang, Kewen ; Wang, Zhe ; Topor, Rodney ; Pan, Jeff Z. ; Antoniou, Grigoris. / Eliminating concepts and roles from ontologies in expressive descriptive logics. In: Computational Intelligence. 2014 ; Vol. 30, No. 2. pp. 205-232.
@article{11e4e2625c874aec8a11afcea4a4a4db,
title = "Eliminating concepts and roles from ontologies in expressive descriptive logics",
abstract = "Forgetting is an important tool for reducing ontologies by eliminating some redundant concepts and roles while preserving sound and complete reasoning. Attempts have previously been made to address the problem of forgetting in relatively simple description logics (DLs), such as DL-Lite and extended Eℒ. However, the issue of forgetting for ontologies in more expressive DLs, such as AℒC and OWL DL, is largely unexplored. In particular, the problem of characterizing and computing forgetting for such logics is still open. In this paper, we first define semantic forgetting about concepts and roles in AℒC ontologies and state several important properties of forgetting in this setting. We then define the result of forgetting for concept descriptions in AℒC, state the properties of forgetting for concept descriptions, and present algorithms for computing the result of forgetting for concept descriptions. Unlike the case of DL-Lite, the result of forgetting for an AℒC ontology does not exist in general, even for the special case of forgetting in TBoxes. This makes the problem of computing the result of forgetting in AℒC more challenging. We address this problem by defining a series of approximations to the result of forgetting for AℒC ontologies and studying their properties. Our algorithms for computing approximations can be directly implemented as a plug-in of an ontology editor to enhance its ability of managing and reasoning in (large) ontologies.",
keywords = "DLs, forgetting, ontology",
author = "Kewen Wang and Zhe Wang and Rodney Topor and Pan, {Jeff Z.} and Grigoris Antoniou",
note = "The authors would like to thank the three anonymous referees for their detailed and helpful comments, which have greatly helped in improving the quality of the paper. This work was supported by the Australia Research Council (ARC) Discovery Projects DP1093652 and DP110101042. A major part of this work was done when Zhe Wang was at Griffith University.",
year = "2014",
month = "5",
day = "6",
doi = "10.1111/j.1467-8640.2012.00442.x",
language = "English",
volume = "30",
pages = "205--232",
journal = "Computational Intelligence",
issn = "0824-7935",
publisher = "Wiley-Blackwell",
number = "2",

}

TY - JOUR

T1 - Eliminating concepts and roles from ontologies in expressive descriptive logics

AU - Wang, Kewen

AU - Wang, Zhe

AU - Topor, Rodney

AU - Pan, Jeff Z.

AU - Antoniou, Grigoris

N1 - The authors would like to thank the three anonymous referees for their detailed and helpful comments, which have greatly helped in improving the quality of the paper. This work was supported by the Australia Research Council (ARC) Discovery Projects DP1093652 and DP110101042. A major part of this work was done when Zhe Wang was at Griffith University.

PY - 2014/5/6

Y1 - 2014/5/6

N2 - Forgetting is an important tool for reducing ontologies by eliminating some redundant concepts and roles while preserving sound and complete reasoning. Attempts have previously been made to address the problem of forgetting in relatively simple description logics (DLs), such as DL-Lite and extended Eℒ. However, the issue of forgetting for ontologies in more expressive DLs, such as AℒC and OWL DL, is largely unexplored. In particular, the problem of characterizing and computing forgetting for such logics is still open. In this paper, we first define semantic forgetting about concepts and roles in AℒC ontologies and state several important properties of forgetting in this setting. We then define the result of forgetting for concept descriptions in AℒC, state the properties of forgetting for concept descriptions, and present algorithms for computing the result of forgetting for concept descriptions. Unlike the case of DL-Lite, the result of forgetting for an AℒC ontology does not exist in general, even for the special case of forgetting in TBoxes. This makes the problem of computing the result of forgetting in AℒC more challenging. We address this problem by defining a series of approximations to the result of forgetting for AℒC ontologies and studying their properties. Our algorithms for computing approximations can be directly implemented as a plug-in of an ontology editor to enhance its ability of managing and reasoning in (large) ontologies.

AB - Forgetting is an important tool for reducing ontologies by eliminating some redundant concepts and roles while preserving sound and complete reasoning. Attempts have previously been made to address the problem of forgetting in relatively simple description logics (DLs), such as DL-Lite and extended Eℒ. However, the issue of forgetting for ontologies in more expressive DLs, such as AℒC and OWL DL, is largely unexplored. In particular, the problem of characterizing and computing forgetting for such logics is still open. In this paper, we first define semantic forgetting about concepts and roles in AℒC ontologies and state several important properties of forgetting in this setting. We then define the result of forgetting for concept descriptions in AℒC, state the properties of forgetting for concept descriptions, and present algorithms for computing the result of forgetting for concept descriptions. Unlike the case of DL-Lite, the result of forgetting for an AℒC ontology does not exist in general, even for the special case of forgetting in TBoxes. This makes the problem of computing the result of forgetting in AℒC more challenging. We address this problem by defining a series of approximations to the result of forgetting for AℒC ontologies and studying their properties. Our algorithms for computing approximations can be directly implemented as a plug-in of an ontology editor to enhance its ability of managing and reasoning in (large) ontologies.

KW - DLs

KW - forgetting

KW - ontology

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

U2 - 10.1111/j.1467-8640.2012.00442.x

DO - 10.1111/j.1467-8640.2012.00442.x

M3 - Article

VL - 30

SP - 205

EP - 232

JO - Computational Intelligence

JF - Computational Intelligence

SN - 0824-7935

IS - 2

ER -