A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Similarity assessment is a key operation in many artificial intelligence fields, such as case-based reasoning, instance-based learning, ontology matching, clustering, etc. This paper presents a novel measure for assessing similarity between individuals represented using Description Logic (DL). We will show how the ideas of refinement operators and refinement graph, originally introduced for inductive logic programming, can be used for assessing similarity in DL and also for abstracting awaydoi:10.1007/978-3-642-23291-6_22 fatcat:2gtiv3djcndolegjsymyyep5wu