A kernel revision operator for terminologies - Algorithms and evaluation

Guilin Qi*, Peter Haase, Zhisheng Huang, Qiu Ji, Jeff Z. Pan, Johanna Völker

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

47 Citations (Scopus)

Abstract

Revision of a description logic-based ontology deals with the problem of incorporating newly received information consistently. In this paper, we propose a general operator for revising terminologies in description logic-based ontologies. Our revision operator relies on a reformulation of the kernel contraction operator in belief revision. We first define our revision operator for terminologies and show that it satisfies some desirable logical properties. Second, two algorithms are developed to instantiate the revision operator. Since in general, these two algorithms are computationally too hard, we propose a third algorithm as a more efficient alternative. We implemented the algorithms and provide evaluation results on their efficiency, effectiveness and meaningfulness in the context of two application scenarios: Incremental ontology learning and mapping revision.

Original languageEnglish
Title of host publicationThe Semantic Web - ISWC 2008 - 7th International Semantic Web Conference, ISWC 2008, Proceedings
Pages419-434
Number of pages16
DOIs
Publication statusPublished - 15 Dec 2008
Event7th International Semantic Web Conference, ISWC 2008 - Karlsruhe, Germany
Duration: 26 Oct 200830 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5318 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Semantic Web Conference, ISWC 2008
Country/TerritoryGermany
CityKarlsruhe
Period26/10/0830/10/08

Fingerprint

Dive into the research topics of 'A kernel revision operator for terminologies - Algorithms and evaluation'. Together they form a unique fingerprint.

Cite this