{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:U52VNFLR4ZKVUR3XM6PQDXAV3D","short_pith_number":"pith:U52VNFLR","schema_version":"1.0","canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","source":{"kind":"arxiv","id":"cs/0406013","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Bound Disjunctive Queries with Constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"E. Zumpano, G. Greco, I. Trubtsyna, S. Greco","submitted_at":"2004-06-07T12:13:58Z","abstract_excerpt":"\"To Appear in Theory and Practice of Logic Programming (TPLP)\" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the size of the data relevant to answer the query and, consequently, reduces both the complexity of computing a single model and the number of "},"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":"cs/0406013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"4969ddf7d2fbba8a1073196dd9e6e699b7e1234d85f87a259d77fdae91634f3c","abstract_canon_sha256":"9749a0e59275c2ed7613c7302fff097191644be95465980dc190953b3e3c0aa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:44.147816Z","signature_b64":"hsRnl9RFwCI9tU0HxFvXk9sZZVlrjPFD7wh3fpDZigdZMwgWYcoInWUhEijdBLYaQqtr+AGVbUHdddMei+dfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","last_reissued_at":"2026-07-04T14:24:44.147461Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:44.147461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Bound Disjunctive Queries with Constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"E. Zumpano, G. Greco, I. Trubtsyna, S. Greco","submitted_at":"2004-06-07T12:13:58Z","abstract_excerpt":"\"To Appear in Theory and Practice of Logic Programming (TPLP)\" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the size of the data relevant to answer the query and, consequently, reduces both the complexity of computing a single model and the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0406013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0406013","created_at":"2026-07-04T14:24:44.147516+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0406013v1","created_at":"2026-07-04T14:24:44.147516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406013","created_at":"2026-07-04T14:24:44.147516+00:00"},{"alias_kind":"pith_short_12","alias_value":"U52VNFLR4ZKV","created_at":"2026-07-04T14:24:44.147516+00:00"},{"alias_kind":"pith_short_16","alias_value":"U52VNFLR4ZKVUR3X","created_at":"2026-07-04T14:24:44.147516+00:00"},{"alias_kind":"pith_short_8","alias_value":"U52VNFLR","created_at":"2026-07-04T14:24:44.147516+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/U52VNFLR4ZKVUR3XM6PQDXAV3D","json":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D.json","graph_json":"https://pith.science/api/pith-number/U52VNFLR4ZKVUR3XM6PQDXAV3D/graph.json","events_json":"https://pith.science/api/pith-number/U52VNFLR4ZKVUR3XM6PQDXAV3D/events.json","paper":"https://pith.science/paper/U52VNFLR"},"agent_actions":{"view_html":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D","download_json":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D.json","view_paper":"https://pith.science/paper/U52VNFLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0406013&json=true","fetch_graph":"https://pith.science/api/pith-number/U52VNFLR4ZKVUR3XM6PQDXAV3D/graph.json","fetch_events":"https://pith.science/api/pith-number/U52VNFLR4ZKVUR3XM6PQDXAV3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/action/storage_attestation","attest_author":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/action/author_attestation","sign_citation":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/action/citation_signature","submit_replication":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/action/replication_record"}},"created_at":"2026-07-04T14:24:44.147516+00:00","updated_at":"2026-07-04T14:24:44.147516+00:00"}