We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we present a tractable algorithm which, given two terminologies and a signature, outputs a set of concepts, which can be regarded as the logical difference between the two terminologies. As a consequence, the algorithm can also decide whether they imply the same concept implications in the signature. A prototype implementation CEX of this algorithm is presented and experimental results based on distinct versions of SNOMED CT, the Systematized Nomenclature of Medicine, Clinical Terms, are discussed. Finally, results regarding the relation to uniform interpolants and possible extensions to more expressive description logics are presented. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Konev, B., Walther, D., & Wolter, F. (2008). The logical difference problem for description logic terminologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5195 LNAI, pp. 259–274). https://doi.org/10.1007/978-3-540-71070-7_21
Mendeley helps you to discover research relevant for your work.