{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_1f73e1acc3aeaa2fda6cca08fadf60f02e65fd997f310034ff09cfa0e85614bc","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_1f73e1acc3aeaa2fda6cca08fadf60f02e65fd997f310034ff09cfa0e85614bc","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"e707eb0f4ecc8d10f31862c44edcff983b39fb96e4281a278f175b6bca11e485","published":"Fri, 24 Jul 2026 00:00:00 -0400","receipt_hash":"e707eb0f4ecc8d10f31862c44edcff983b39fb96e4281a278f175b6bca11e485","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"e707eb0f4ecc8d10f31862c44edcff983b39fb96e4281a278f175b6bca11e485","observed_at":"2026-07-24T04:43:08.456021Z","parent_run_hash":"b018378f86139a28e6209ec008b31c1282cd1b5c1632dbd43b054c17aa88ab96","published":"Fri, 24 Jul 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2607.21203v1 Announce Type: new \nAbstract: Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies. Most popular semantics for logic programming have this property of well-supportedness. We recognize two limitations of the current well-supported semantics for DL programs: its increased computational complexity for the consistency problem and its lack of a reduct transformation characterization.  In this work, we present a new semantics which evaluates ontological atoms more strictly than the current semantics. This keeps the complexity of its consistency problem NP-complete, rather than increasing it to the second level of the polynomial hierarchy. Additionally, we identify a syntactic class of description logic programs for which our new semantics is equivalent to the current semantics. We characterize our semantics using a fixpoint","title":"A New Well-Supported Semantics for Description Logic Programs","url":"https://arxiv.org/abs/2607.21203","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.21203v1 Announce Type: new \nAbstract: Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies. Most popular semantics for logic programming have this property of well-supportedness. We recognize two limitations of the current well-supported semantics for DL programs: its increased computational complexity for the consistency problem and its lack of a reduct transformation characterization.  In this work, we present a new semantics which evaluates ontological atoms more strictly than the current semantics. This keeps the complexity of its consistency problem NP-complete, rather than increasing it to the second level of the polynomial hierarchy. Additionally, we identify a syntactic class of description logic programs for which our new semantics is equivalent to the current semantics. We characterize our semantics using a fixpoint","title":"A New Well-Supported Semantics for Description Logic Programs","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-24T04:43:08Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.21203"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:8056553be8e7b6099dc052311d94ac2766fca156a0f9117e3347475736e078db00995cf1a4c8275a6808b8f4ab5155316850aec4ff8baed2ffaa5fbf7e6d3d0c","signer":"crovia.substrate","subject":{"observed_at":"2026-07-24T04:43:08Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.21203"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"d994aec879726ef3f130498cec63d45b0fadc5a60e2bbac37a8d6994889603c8","leaf_index":347040,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"5cdee470eded484928d6ca1133c1716e2ed366ef715c2350db8e2481ec25f6c3","side":"right"},{"sibling":"18e79ea38754f4dbcb9c60cb3be06f96b632261a50125ac842bb2ce6afbc8f22","side":"right"},{"sibling":"50a6d0afcc9c5af1b50c6f0209b34d7a7c9e198b2cc817cea9efddc9d9ff8582","side":"right"},{"sibling":"7510bb7fcb210416846421fe8aedf8053b6c5d3e388cf9fb6248a102e5654115","side":"right"},{"sibling":"9bc1243164793a5595fdf94a9704736aedef1110100e57802bd8272a119b8c37","side":"right"},{"sibling":"35324677b23e55f1ffa43dd5b4dd9dc3c11e5ce4d8e088d669a002edfb294b27","side":"left"},{"sibling":"09a4759d227421c77e1462a3c333b1907095af488295f5ae40a2926b1ac32eed","side":"right"},{"sibling":"735b40cd86add2eb12982a84f45647b35267af61e771b38192432357dac71eb1","side":"left"},{"sibling":"c212fcc83c532c0321804b72fe72b546946bb055d3d482aab19c43f5bebfbf3f","side":"left"},{"sibling":"da189c159d0789c2229cf3731890cc753832dab1aa83e4bbf0fac01955c22cd8","side":"left"},{"sibling":"3a02ed8ea41a09957282e4e27db74ed88cd675156461abb02acb28e2cd257e63","side":"right"},{"sibling":"d3139af8c5ce235438e1c69e4b7afa44ba09129fd86674968434f23e546f423e","side":"left"},{"sibling":"cb89775a838ee16d10fc8da3213420c2012b4d96e8d55cd49939b0887a4b92d3","side":"right"},{"sibling":"252d30ea8052c3bb6b40bc5cc29fc9b9725343d212f84c08fbbae4215a125b00","side":"right"},{"sibling":"f3e45bceed774d2402fa45d41ff5190f295823bd2f216eb90157884150034693","side":"left"},{"sibling":"3cfa2102c0224815c6f3bf73e6710e24103f43f7bf5da1ca2abad1416d9c0890","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"e871fd7edf9b2ad89bce1609a028f5225eea4d14372169bac242420830f86530","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":347413,"merkle_root":"9efe042c5dd6583dfd3b6a58fbfc289807f60bcf2bd2927f10488a54a8ba11fc","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260724T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-24T05:38:42Z","sig_algorithm":"ed25519","signature":"8633c55f558d42994850505218b2862c6134bad2b1c80d4b80736c2fd3ea7a19690ca3498727a8adbdc47791176128a8d64bef0883b888db809f0477355bd00c","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_1f73e1acc3aeaa2fda6cca08fadf60f02e65fd997f310034ff09cfa0e85614bc"}}