{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:26LCCKM3IJOPTUHHT2V2LHB6DM","short_pith_number":"pith:26LCCKM3","schema_version":"1.0","canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","source":{"kind":"arxiv","id":"1411.2516","version":3},"attestation_state":"computed","paper":{"title":"Answering Conjunctive Queries over $\\mathcal{EL}$ Knowledge Bases with Transitive and Reflexive Roles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Boris Motik, Giorgio Stefanoni","submitted_at":"2014-11-10T17:50:06Z","abstract_excerpt":"Answering conjunctive queries (CQs) over $\\mathcal{EL}$ knowledge bases (KBs) with complex role inclusions is PSPACE-hard and in PSPACE in certain cases; however, if complex role inclusions are restricted to role transitivity, the tight upper complexity bound has so far been unknown. Furthermore, the existing algorithms cannot handle reflexive roles, and they are not practicable. Finally, the problem is tractable for acyclic CQs and $\\mathcal{ELH}$, and NP-complete for unrestricted CQs and $\\mathcal{ELHO}$ KBs. In this paper we complete the complexity landscape of CQ answering for several impo"},"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":"1411.2516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-10T17:50:06Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"7ad8b8ddc3abda33e104513fe2b1e0d8d1df06e2ace0861572dbada8c0149771","abstract_canon_sha256":"b7bc492a54616047913f0ccaa719a242d21c121fe65b7e11dc029367eacbb353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:11.161094Z","signature_b64":"t286cHCgb14iJ0HjPyyWnNwSwJ4T6rOJNVB9JOFfkEInyIO31rNdjQiBYiarsicytNusETQ4uA6o7BIiDJtsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79621299b425cf9d0e79eaba59c3e1b1bcedfe1069a9f4af9044c15fb2f1174","last_reissued_at":"2026-05-18T02:12:11.160369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:11.160369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering Conjunctive Queries over $\\mathcal{EL}$ Knowledge Bases with Transitive and Reflexive Roles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Boris Motik, Giorgio Stefanoni","submitted_at":"2014-11-10T17:50:06Z","abstract_excerpt":"Answering conjunctive queries (CQs) over $\\mathcal{EL}$ knowledge bases (KBs) with complex role inclusions is PSPACE-hard and in PSPACE in certain cases; however, if complex role inclusions are restricted to role transitivity, the tight upper complexity bound has so far been unknown. Furthermore, the existing algorithms cannot handle reflexive roles, and they are not practicable. Finally, the problem is tractable for acyclic CQs and $\\mathcal{ELH}$, and NP-complete for unrestricted CQs and $\\mathcal{ELHO}$ KBs. In this paper we complete the complexity landscape of CQ answering for several impo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2516","kind":"arxiv","version":3},"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":"1411.2516","created_at":"2026-05-18T02:12:11.160502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2516v3","created_at":"2026-05-18T02:12:11.160502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2516","created_at":"2026-05-18T02:12:11.160502+00:00"},{"alias_kind":"pith_short_12","alias_value":"26LCCKM3IJOP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"26LCCKM3IJOPTUHH","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"26LCCKM3","created_at":"2026-05-18T12:28:09.283467+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/26LCCKM3IJOPTUHHT2V2LHB6DM","json":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM.json","graph_json":"https://pith.science/api/pith-number/26LCCKM3IJOPTUHHT2V2LHB6DM/graph.json","events_json":"https://pith.science/api/pith-number/26LCCKM3IJOPTUHHT2V2LHB6DM/events.json","paper":"https://pith.science/paper/26LCCKM3"},"agent_actions":{"view_html":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM","download_json":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM.json","view_paper":"https://pith.science/paper/26LCCKM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2516&json=true","fetch_graph":"https://pith.science/api/pith-number/26LCCKM3IJOPTUHHT2V2LHB6DM/graph.json","fetch_events":"https://pith.science/api/pith-number/26LCCKM3IJOPTUHHT2V2LHB6DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/action/storage_attestation","attest_author":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/action/author_attestation","sign_citation":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/action/citation_signature","submit_replication":"https://pith.science/pith/26LCCKM3IJOPTUHHT2V2LHB6DM/action/replication_record"}},"created_at":"2026-05-18T02:12:11.160502+00:00","updated_at":"2026-05-18T02:12:11.160502+00:00"}