Guohua Shen, Zhiqiu Huang, Xiaodong Zhu, Lei Wang, Gaoyou Xiang
{"title":"用描述逻辑推理器进行本体匹配","authors":"Guohua Shen, Zhiqiu Huang, Xiaodong Zhu, Lei Wang, Gaoyou Xiang","doi":"10.1109/IITA.2007.95","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":191218,"journal":{"name":"Workshop on Intelligent Information Technology Application (IITA 2007)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Using Description Logics Reasoner for Ontology Matching\",\"authors\":\"Guohua Shen, Zhiqiu Huang, Xiaodong Zhu, Lei Wang, Gaoyou Xiang\",\"doi\":\"10.1109/IITA.2007.95\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":191218,\"journal\":{\"name\":\"Workshop on Intelligent Information Technology Application (IITA 2007)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Intelligent Information Technology Application (IITA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IITA.2007.95\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Intelligent Information Technology Application (IITA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IITA.2007.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using Description Logics Reasoner for Ontology Matching
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.