{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PT2MNIRTWGKJXZ7J6SUJUX7VNK","short_pith_number":"pith:PT2MNIRT","schema_version":"1.0","canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","source":{"kind":"arxiv","id":"1407.7934","version":1},"attestation_state":"computed","paper":{"title":"Backwards State-space Reduction for Planning in Dynamic Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michele Stawowy (IMT Institute for Advanced Studies), Valerio Senni","submitted_at":"2014-07-30T03:28:15Z","abstract_excerpt":"In this paper we address the problem of planning in rich domains, where knowledge representation is a key aspect for managing the complexity and size of the planning domain. We follow the approach of Description Logic (DL) based Dynamic Knowledge Bases, where a state of the world is represented concisely by a (possibly changing) ABox and a (fixed) TBox containing the axioms, and actions that allow to change the content of the ABox. The plan goal is given in terms of satisfaction of a DL query. In this paper we start from a traditional forward planning algorithm and we propose a much more effic"},"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":"1407.7934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"f3b896b1532d74a63b7cfc63d02b922bcb15543461e730deef5f27948d9e064b","abstract_canon_sha256":"c189af790cfb9ad1bba53114bf9dd8ec42817e4d59bc89df136a10139b9af9f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:14.088067Z","signature_b64":"IOCB/fom1ssVVpL/yEgBOkHg7WqOxn2GiqnhX2sNkB3TYsirrQGsMnac3Z7SK3mZAd7fwB/+FOepwmtAPfO5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","last_reissued_at":"2026-05-18T02:46:14.087394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:14.087394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backwards State-space Reduction for Planning in Dynamic Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michele Stawowy (IMT Institute for Advanced Studies), Valerio Senni","submitted_at":"2014-07-30T03:28:15Z","abstract_excerpt":"In this paper we address the problem of planning in rich domains, where knowledge representation is a key aspect for managing the complexity and size of the planning domain. We follow the approach of Description Logic (DL) based Dynamic Knowledge Bases, where a state of the world is represented concisely by a (possibly changing) ABox and a (fixed) TBox containing the axioms, and actions that allow to change the content of the ABox. The plan goal is given in terms of satisfaction of a DL query. In this paper we start from a traditional forward planning algorithm and we propose a much more effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7934","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":"1407.7934","created_at":"2026-05-18T02:46:14.087496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7934v1","created_at":"2026-05-18T02:46:14.087496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7934","created_at":"2026-05-18T02:46:14.087496+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT2MNIRTWGKJ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT2MNIRTWGKJXZ7J","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT2MNIRT","created_at":"2026-05-18T12:28:43.426989+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/PT2MNIRTWGKJXZ7J6SUJUX7VNK","json":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK.json","graph_json":"https://pith.science/api/pith-number/PT2MNIRTWGKJXZ7J6SUJUX7VNK/graph.json","events_json":"https://pith.science/api/pith-number/PT2MNIRTWGKJXZ7J6SUJUX7VNK/events.json","paper":"https://pith.science/paper/PT2MNIRT"},"agent_actions":{"view_html":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK","download_json":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK.json","view_paper":"https://pith.science/paper/PT2MNIRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7934&json=true","fetch_graph":"https://pith.science/api/pith-number/PT2MNIRTWGKJXZ7J6SUJUX7VNK/graph.json","fetch_events":"https://pith.science/api/pith-number/PT2MNIRTWGKJXZ7J6SUJUX7VNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/action/storage_attestation","attest_author":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/action/author_attestation","sign_citation":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/action/citation_signature","submit_replication":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/action/replication_record"}},"created_at":"2026-05-18T02:46:14.087496+00:00","updated_at":"2026-05-18T02:46:14.087496+00:00"}