A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Computing the similarity between data elements is a basic functionality in flexible query answering systems. In the case of complex data definitions, for instance in terms of an ontology, computing the similarity between data elements becomes a non-trivial problem. In this paper, we propose a similarity measure for data described in terms of the DL-lite ontology language. In this measure, we take implicit information contained in the definition of classes and relations into account. In contrastdoi:10.1007/978-3-642-04957-6_35 fatcat:kooacjqpandqdilrdufvt2vk6q