Algorithms for the Reconciliation of Ontologies in Open Environments

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01060670
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 2:45:38 PM
Last modification on : Monday, December 18, 2017 - 1:11:00 AM
Long-term archiving on : Sunday, February 18, 2018 - 2:23:24 PM

File

LiuCY10.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

171

Files downloads

77