Roughening the EL Envelope

Rafael PeñalozaRafael Peñaloza,  Tingting ZouTingting Zou
Rafael Peñaloza, Tingting Zou
Roughening the EL Envelope
In P. Fontaine and C. Ringeissen and R. A. Schmidt, eds., Proceedings of the 2013 International Symposium on Frontiers of Combining Systems (FroCoS 2013), volume 8152 of Lecture Notes in Computer Science, 71-86, 2013. Springer
• KurzfassungAbstract
The EL family of description logics (DLs) has been successfully applied for representing the knowledge of several domains, specially from the bio-medical fields. One of its principal characteristics is that its reasoning tasks have polynomial complexity, which makes them suitable for large-scale knowledge bases. In their classical form, these logics cannot handle imprecise concepts in a satisfactory manner. Rough sets have been studied as a method for describing imprecise notions, by providing a lower and an upper approximation, which are defined through classes of indiscernible elements. In this paper we study the combination of the EL family of DLs with the notion of rough sets, thus obtaining a family of rough DLs. We show that the rough extension of these DLs maintains the polynomial-time complexity enjoyed by its classical counterpart. We also present a completion-based algorithm that is a strict generalization of the known method for the DL EL++.
• Forschungsgruppe:Research Group: Automatentheorie
The final publication is available at Springer.
@inproceedings{ PeZo-FroCoS13,
author = {Rafael {Pe{\~n}aloza} and Tingting {Zou}},
booktitle = {Proceedings of the 2013 International Symposium on Frontiers of Combining Systems ({FroCoS 2013})},
editor = {P. {Fontaine} and C. {Ringeissen} and R. A. {Schmidt}},
pages = {71--86},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {Roughening the $\mathcal{EL}$ Envelope},
volume = {8152},
year = {2013},
}