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.
Reference:
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.
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
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
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.
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.