A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure

TL;DR

This paper presents a polynomial time algorithm for concept subsumption under Rational Closure in nominal safe $ ext{ELO}_ot$, enabling efficient non-monotonic reasoning in OWL 2 EL profiles using existing reasoners.

Contribution

It introduces a polynomial time subsumption algorithm for nominal safe $ ext{ELO}_ot$ under RC, based solely on classical $ ext{EL}_ot$ tests, and extends it to Defeasible Inheritance-based DLs.

Findings

Polynomial time subsumption procedure for $ ext{ELO}_ot$ under RC

Uses classical $ ext{EL}_ot$ reasoners as black boxes

Extended method to Defeasible Inheritance-based DLs

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 $\mathcal{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 $\mathcal{ELO}_\bot$ under RC that relies entirely on a series of classical, monotonic $\mathcal{EL}_\bot$ subsumption tests. Therefore, any existing classical monotonic $\mathcal{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.