Algorithms for the Reconciliation of Ontologies in Open Environments - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Algorithms for the Reconciliation of Ontologies in Open Environments

(1) , (1) , (1)
1

Abstract

The dynamic changing feature of Semantic Web determines that the ontology which is a part of Semantic Web needs constantly to be modified in order to adapt outer environment. In this paper we make a careful analysis of the ontology changes' complexity under open environment. The main contents discussed are as follow. At first we point out all possible relation types between any two ontology change sequences including directly conflict relation, indirectly conflict relation, dependent relation and compatible relation according to ontology change's definition. And then we propose a new algorithm named Algorithm of Searching Maximum and Sequential Ontology Change Sequence Set(ASMSOCSS) to find all maximum and sequential ontology change sequence subset in the prime ontology change sequence set and prove the independence of the result which may be got after running ASMSOCSS. At last we put forward the algorithm by using these maximum and sequential ontology change sequence sets to create new ontology versions according to the dependence relation between ontology change sequences.
Fichier principal
Vignette du fichier
LiuCY10.pdf (280.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01060670 , version 1 (17-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Yaqing Liu, Rong Chen, Hong Yang. Algorithms for the Reconciliation of Ontologies in Open Environments. 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI), Oct 2010, Larnaca, Cyprus. pp.211-218, ⟨10.1007/978-3-642-16239-8_29⟩. ⟨hal-01060670⟩
49 View
36 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More