A Polynomial Time Subsumption Algorithm for Nominal Safe ${\mathcal{E}\mathcal{L}\mathcal{O}}_{\perp }$ under Rational Closure

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

References in corpus (3)

• The DL-Lite Family and Relations
• The Complexity of Circumscription in DLs
• Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure

Cited by in corpus (9)

• On Rational Entailment for Propositional Typicality Logic
• A conditional, a fuzzy and a probabilistic interpretation of self-organising maps
• Theoretical Foundations of Defeasible Description Logics
• A framework for a modular multi-concept lexicographic closure semantics
• Defeasible RDFS via Rational Closure
• Weighted Conditional EL{^}bot Knowledge Bases with Integer Weights: an ASP Approach
• Reasoning on ${\text{DL-Lite}}_{\mathcal{R}}$ with Defeasibility in ASP
• A Rational Entailment for Expressive Description Logics via Description Logic Programs
• From Weighted Conditionals of Multilayer Perceptrons to Gradual Argumentation and Back