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++
Penaloza, R., Zou, T. (2013). Roughening the EL Envelope. In Frontiers of Combining Systems: 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings (pp.71-86). Springer-Verlag [10.1007/978-3-642-40885-4_6].
Roughening the EL Envelope
Penaloza, R
;
2013
Abstract
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++
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Penaloza-2013-FroCo-AAM.pdf
accesso aperto
Descrizione: Conference Paper
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Licenza:
Altro
Dimensione
488.44 kB
Formato
Adobe PDF
|
488.44 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
