By Topic

Using Description Logics Reasoner for Ontology Matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Guohua Shen ; Nanjing Univ. of Aeronaut. & Astronaut., Nanjing ; Zhiqiu Huang ; Xiaodong Zhu ; Lei Wang
more authors

Ontology matching produces correspondences between elements of two ontologies and it is a basic problem in many database application domains. A Description Logics-based ontology matching approach is proposed. The approach achieves the matching by means of semantic interpretation. The algorithm of deciding ontology correspondences (such as equivalence, more general, less general, disjointness, overlapping) is presented, which is reasoned based on concept inclusion. The reasoner RacerPro is selected to deduce ontology mapping, and the experimental results demonstrate that the approach is feasible.

Published in:

Intelligent Information Technology Application, Workshop on

Date of Conference:

2-3 Dec. 2007