{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BCFONLI6YXPTXLTASL66NTKRVV","short_pith_number":"pith:BCFONLI6","schema_version":"1.0","canonical_sha256":"088ae6ad1ec5df3bae6092fde6cd51ad43a88c411e0a80dab277d0398b9cf3e2","source":{"kind":"arxiv","id":"1405.4180","version":1},"attestation_state":"computed","paper":{"title":"Algorithm for Adapting Cases Represented in a Tractable Description Logic","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Liang Chang, Tianlong Gu, Uli Sattler","submitted_at":"2014-05-16T14:24:42Z","abstract_excerpt":"Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \\emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\\mathcal{EL_{\\bot}}$. Following the"},"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":"1405.4180","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2014-05-16T14:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"be99558788fda5c5b12837fd66d3019db67280e266eec8d619b7aeeabe6f202d","abstract_canon_sha256":"85eb8d5635cd99fdeeb76c15ecc5d0541d0541524867769c5bd98b1db33a2aa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.963783Z","signature_b64":"CwfiSCWwNV8IHn/vzk5zlJz4D2k80vJj0DE+hgnlLSdaDX/2cnUAuIpZNzjZSU+QF6My8b93fpzhHP0GnM2LDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088ae6ad1ec5df3bae6092fde6cd51ad43a88c411e0a80dab277d0398b9cf3e2","last_reissued_at":"2026-05-18T02:51:42.963303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.963303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for Adapting Cases Represented in a Tractable Description Logic","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Liang Chang, Tianlong Gu, Uli Sattler","submitted_at":"2014-05-16T14:24:42Z","abstract_excerpt":"Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \\emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\\mathcal{EL_{\\bot}}$. Following the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4180","kind":"arxiv","version":1},"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":"1405.4180","created_at":"2026-05-18T02:51:42.963396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4180v1","created_at":"2026-05-18T02:51:42.963396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4180","created_at":"2026-05-18T02:51:42.963396+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCFONLI6YXPT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCFONLI6YXPTXLTA","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCFONLI6","created_at":"2026-05-18T12:28:22.404517+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/BCFONLI6YXPTXLTASL66NTKRVV","json":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV.json","graph_json":"https://pith.science/api/pith-number/BCFONLI6YXPTXLTASL66NTKRVV/graph.json","events_json":"https://pith.science/api/pith-number/BCFONLI6YXPTXLTASL66NTKRVV/events.json","paper":"https://pith.science/paper/BCFONLI6"},"agent_actions":{"view_html":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV","download_json":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV.json","view_paper":"https://pith.science/paper/BCFONLI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4180&json=true","fetch_graph":"https://pith.science/api/pith-number/BCFONLI6YXPTXLTASL66NTKRVV/graph.json","fetch_events":"https://pith.science/api/pith-number/BCFONLI6YXPTXLTASL66NTKRVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV/action/storage_attestation","attest_author":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV/action/author_attestation","sign_citation":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV/action/citation_signature","submit_replication":"https://pith.science/pith/BCFONLI6YXPTXLTASL66NTKRVV/action/replication_record"}},"created_at":"2026-05-18T02:51:42.963396+00:00","updated_at":"2026-05-18T02:51:42.963396+00:00"}