Casini, Giovanni and Straccia, Umberto and Meyer, Thomas (2019) A polynomial Time Subsumption Algorithm for Nominal Safe ELO under Rational Closure, Information Science, 501, 588-620, Elsevier.
![[img]](http://pubs.cs.uct.ac.za/style/images/fileicons/text.png) |
Text
Inf. Sci. 2019 Casini.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⊥, 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.
| Item Type: | Journal article (paginated) |
|---|---|
| Subjects: | Computing methodologies > Artificial intelligence > Knowledge representation and reasoning |
| Date Deposited: | 15 Jan 2020 11:31 |
| Last Modified: | 15 Jan 2020 11:31 |
| URI: | http://pubs.cs.uct.ac.za/id/eprint/1368 |
Actions (login required)
 |
View Item |