Casini, Giovanni and Straccia, Umberto and Meyer, Thomas (2018) A polynomial Time Subsumption Algorithm for Nominal Safe ELO_bot under Rational Closure, Information Sciences, 1-33, Elsevier.
![[img]](http://pubs.cs.uct.ac.za/style/images/fileicons/application_pdf.png) |
PDF
1-s2.0-S0020025518307436-main.pdf Download (1MB) |
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_bot, 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_bot under RC that relies entirely on a series of classical, monotonic EL_bot subsumption tests. Therefore, any existing classical monotonic EL_bot 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.
| Item Type: | Journal article (paginated) |
|---|---|
| Uncontrolled Keywords: | Description Logics, Non-monotonic reasoning |
| Subjects: | Computing methodologies > Artificial intelligence |
| Alternate Locations: | https://doi.org/10.1016/j.ins.2018.09.037 |
| Date Deposited: | 10 Jan 2019 |
| Last Modified: | 10 Oct 2019 15:31 |
| URI: | http://pubs.cs.uct.ac.za/id/eprint/1297 |
Actions (login required)
 |
View Item |