dc.contributor.author |
Casini, G
|
|
dc.contributor.author |
Straccia, U
|
|
dc.contributor.author |
Meyer, Thomas A
|
|
dc.date.accessioned |
2019-06-28T12:58:28Z |
|
dc.date.available |
2019-06-28T12:58:28Z |
|
dc.date.issued |
2018-09 |
|
dc.identifier.citation |
Casini, G., Straccia, U and Meyer, T.A. 2018. A polynomial time subsumption algorithm for nominal safe ELO under rational closure. Information Sciences, pp1-33. |
en_US |
dc.identifier.issn |
0020-0255 |
|
dc.identifier.issn |
1872-6291 |
|
dc.identifier.uri |
https://www.sciencedirect.com/science/article/pii/S0020025518307436
|
|
dc.identifier.uri |
DOI: 10.1016/j.ins.2018.09.037
|
|
dc.identifier.uri |
http://hdl.handle.net/10204/11016
|
|
dc.description |
Copyright: 2018 Elsevier. Due to copyright restrictions, the attached PDF file only contains the abstract of the full text item. For access to the full text item, kindly consult the publisher's website. |
en_US |
dc.description.abstract |
Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe ELO , a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe ELO under RC that relies entirely on a series of classical, monotonic EL subsumption tests. Therefore, any existing classical monotonic EL reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Elsevier |
en_US |
dc.relation.ispartofseries |
Worklist; 22094 |
|
dc.relation.ispartofseries |
Worklist; 23261 |
|
dc.subject |
Description logic EL |
en_US |
dc.subject |
Defeasible reasoning |
en_US |
dc.subject |
Nonmonotonic reasoning |
en_US |
dc.subject |
Rational closure |
en_US |
dc.title |
A polynomial time subsumption algorithm for nominal safe ELO under rational closure |
en_US |
dc.type |
Article |
en_US |
dc.identifier.apacitation |
Casini, G., Straccia, U., & Meyer, T. A. (2018). A polynomial time subsumption algorithm for nominal safe ELO under rational closure. http://hdl.handle.net/10204/11016 |
en_ZA |
dc.identifier.chicagocitation |
Casini, G, U Straccia, and Thomas A Meyer "A polynomial time subsumption algorithm for nominal safe ELO under rational closure." (2018) http://hdl.handle.net/10204/11016 |
en_ZA |
dc.identifier.vancouvercitation |
Casini G, Straccia U, Meyer TA. A polynomial time subsumption algorithm for nominal safe ELO under rational closure. 2018; http://hdl.handle.net/10204/11016. |
en_ZA |
dc.identifier.ris |
TY - Article
AU - Casini, G
AU - Straccia, U
AU - Meyer, Thomas A
AB - Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe ELO , a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe ELO under RC that relies entirely on a series of classical, monotonic EL subsumption tests. Therefore, any existing classical monotonic EL reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability.
DA - 2018-09
DB - ResearchSpace
DP - CSIR
KW - Description logic EL
KW - Defeasible reasoning
KW - Nonmonotonic reasoning
KW - Rational closure
LK - https://researchspace.csir.co.za
PY - 2018
SM - 0020-0255
SM - 1872-6291
T1 - A polynomial time subsumption algorithm for nominal safe ELO under rational closure
TI - A polynomial time subsumption algorithm for nominal safe ELO under rational closure
UR - http://hdl.handle.net/10204/11016
ER -
|
en_ZA |