Abstract
Semantic collision is inevitable while building a domain ontology from heterogeneous data sources (semi-)automatically. Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology from structured and semistructured data sources semiautomatically. The method translates the middle model into the Kripke structure, and consistency assertions into CTL formulae, so a consistency checking problem is promoted to a global model checking. Moreover, the feasibility and correctness of the transformation is proved, and case studies are provided.
Highlights
Semantic web has been a great idea and a promising research area for a dozen years [1]
The semantical paradox and ambiguity must be of concern during the process of building the domain ontology, which means the validation of semantic consistency
The finite-state model is always called Kripke structure, and the formal properties are always expressed by computation tree logic (CTL, a logic that is based on a branching-time view) formulae
Summary
Semantic web has been a great idea and a promising research area for a dozen years [1]. Technologies of automatically transforming semistructured data or structured data into a domain ontology through mediate modeling are promising [2,3,4,5,6]. In [2, 7,8,9,10,11], researchers transform structured data (relational database schema) into a middle model and create a domain ontology from the model. In [12, 13], the same middle formal model language has been adopted to model both structured and semistructured data, so the method can be used to build the domain ontology from heterogeneous data sources.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
