A Formal Approach for RDF/S Ontology Evolution

George Konstantinidis, Giorgos Flouris, Grigoris Antoniou, Vassilis Christophides

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Citations (Scopus)

Abstract

In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side-effects of a requested elementary or complex change operation. Our work is inspired by belief revision principles (i.e., validity, success and minimal change) and allows us to handle any change operation in a provably rational and consistent manner. To the best of our knowledge, this is the first approach overcoming the limitations of existing solutions, which deal with each change operation on a per-case basis. Additionally, we rely on our general change handling algorithm to implement specialized versions of it, one per desired change operation, in order to compute the equivalent set of effects and side-effects.2.

Original languageEnglish
Title of host publicationECAI 2008
Subtitle of host publication18th European Conference on Artificial Intelligence
EditorsMalik Ghallab, Constantine D. Spyropoulos, Nikos Fakotakis, Nikos Avouris
PublisherIOS Press
Pages70-74
Number of pages5
Volume178
ISBN (Electronic)9781607503552
ISBN (Print)9781586038915
DOIs
Publication statusPublished - 1 Jun 2008
Externally publishedYes
Event18th European Conference on Artificial Intelligence - Patras, Greece
Duration: 21 Jul 200825 Jul 2008
Conference number: 18

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
Volume178
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314

Conference

Conference18th European Conference on Artificial Intelligence
Abbreviated titleECAI 2008
Country/TerritoryGreece
CityPatras
Period21/07/0825/07/08

Fingerprint

Dive into the research topics of 'A Formal Approach for RDF/S Ontology Evolution'. Together they form a unique fingerprint.

Cite this