{"paper":{"title":"A Polynomial Time Subsumption Algorithm for Nominal Safe $\\mathcal{ELO}_\\bot$ under Rational Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Giovanni Casini, Thomas Meyer, Umberto Straccia","submitted_at":"2018-02-22T17:54:00Z","abstract_excerpt":"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.\n  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$ r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08201","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}