ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.08201
46
38
v1v2 (latest)

A Polynomial Time Subsumption Algorithm for Nominal Safe ELO⊥\mathcal{ELO}_\botELO⊥​ under Rational Closure

22 February 2018
Giovanni Casini
U. Straccia
T. Meyer
ArXiv (abs)PDFHTML
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⊥\mathcal{ELO}_\botELO⊥​, 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⊥\mathcal{ELO}_\botELO⊥​ under RC that relies entirely on a series of classical, monotonic EL⊥\mathcal{EL}_\botEL⊥​ subsumption tests. Therefore, any existing classical monotonic EL⊥\mathcal{EL}_\botEL⊥​ 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.

View on arXiv
Comments on this paper