Applying Logical Constraints to Ontology Matching.pdf

Applying Logical Constraints to Ontology Matching No Author Given No Institute Given Abstract. Automatically discovering semantic relations between ontologies is an important task with respect to overcoming semantic heterogeneity on the se- mantic web. Ontology matching systems, however, often produce erroneous map- pings. In this paper we propose a method for optimizing precision and recall of existing matching systems. The principle of this method is based on the idea that it is possible to infer logical constraints by comparing subsumption relations be- tween concepts of the ontologies to be matched. In order to verify this principle we implemented a system that uses our method as basis for optimizing mappings. We generated a set of synthetic ontologies and corresponding defective mappings and studied the behavior of our method with respect to the proeperties of the matching problem. The results show that our strategy actually improves the qual- ity of the generated mappings. 1 Motivation Recently, a number of heuristic methods for matching concepts from different ontolo- gies have been proposed. These methods rely mostly on computing similarities based on linguistic and structural criteria. Evaluation studies have shown that existing meth- ods often trade off precision and recall. The resulting mapping either contains a fair amount of errors or only covers a small part of the ontologies involved [2, 4]. Our goal is to provide a component for matching systems that optimizes the results with respect to both recall and precision of the generated mapping. The method that we suggest is based on a reasoning approach that goes beyond existing structural methods and can be classified as semantic-based technique due to Euzenat [3]. 1.1 Problem Statem