{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KSVSGY5GV4JGT7NFMSR5EXWSLM","short_pith_number":"pith:KSVSGY5G","schema_version":"1.0","canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","source":{"kind":"arxiv","id":"1802.08201","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.08201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-22T17:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"b7014e5b066847385d0d6a736bc0ba97fac1b9598e2defbefdeb3f4d6d393c1c","abstract_canon_sha256":"f62193cc71e79ce064612833e7f2bd932621a7a610f88a6b3dfdb642b0fc95d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:37.483297Z","signature_b64":"cBtHpvBQ9UHwBBd3PDOAU7B/ZDYQqJ3pQZpNkBRspdO7dE61VBugMJUCJilBiThVrNVbAthUD33BDI3JZrRvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ab2363a6af1269fda564a3d25ed25b0070f14a39d4bce145e4e6b46270381d","last_reissued_at":"2026-05-18T00:04:37.482835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:37.482835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08201","created_at":"2026-05-18T00:04:37.482908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08201v2","created_at":"2026-05-18T00:04:37.482908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08201","created_at":"2026-05-18T00:04:37.482908+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSVSGY5GV4JG","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSVSGY5GV4JGT7NF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSVSGY5G","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM","json":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM.json","graph_json":"https://pith.science/api/pith-number/KSVSGY5GV4JGT7NFMSR5EXWSLM/graph.json","events_json":"https://pith.science/api/pith-number/KSVSGY5GV4JGT7NFMSR5EXWSLM/events.json","paper":"https://pith.science/paper/KSVSGY5G"},"agent_actions":{"view_html":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM","download_json":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM.json","view_paper":"https://pith.science/paper/KSVSGY5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08201&json=true","fetch_graph":"https://pith.science/api/pith-number/KSVSGY5GV4JGT7NFMSR5EXWSLM/graph.json","fetch_events":"https://pith.science/api/pith-number/KSVSGY5GV4JGT7NFMSR5EXWSLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/action/storage_attestation","attest_author":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/action/author_attestation","sign_citation":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/action/citation_signature","submit_replication":"https://pith.science/pith/KSVSGY5GV4JGT7NFMSR5EXWSLM/action/replication_record"}},"created_at":"2026-05-18T00:04:37.482908+00:00","updated_at":"2026-05-18T00:04:37.482908+00:00"}