Rough Description Logics (DLs) have been studied as a means for representing and reasoning with imprecise knowledge. It has been shown that reasoning in rough DLs can be reduced to reasoning in a classical DL that allows value restrictions, and transitive and inverse roles. This shows that for propositionally closed DLs, the complexity of reasoning is not increased by the inclusion of rough constructors. However, applying such a reduction to rough EL yields an exponential time upper bound. We show that this blow-up in complexity can be avoided, providing a polynomial-time completion-based algorithm for classifying rough EL ontologies.
Peñaloza, R., Zou, T. (2013). Rough EL Classification. In 26th International Workshop on Description Logics, DL 2013; Ulm; Germany; 23 July 2013 through 26 July 2013 (pp.415-427). CEUR.
Rough EL Classification
Peñaloza, R
;
2013
Abstract
Rough Description Logics (DLs) have been studied as a means for representing and reasoning with imprecise knowledge. It has been shown that reasoning in rough DLs can be reduced to reasoning in a classical DL that allows value restrictions, and transitive and inverse roles. This shows that for propositionally closed DLs, the complexity of reasoning is not increased by the inclusion of rough constructors. However, applying such a reduction to rough EL yields an exponential time upper bound. We show that this blow-up in complexity can be avoided, providing a polynomial-time completion-based algorithm for classifying rough EL ontologies.
| File | Dimensione | Formato | |
|---|---|---|---|
|
PeZo-DL13.pdf
accesso aperto
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Dimensione
448.03 kB
Formato
Adobe PDF
|
448.03 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
