{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KJWAYGZ6WI5QHKR4DQT7UIPIM4","short_pith_number":"pith:KJWAYGZ6","schema_version":"1.0","canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","source":{"kind":"arxiv","id":"1506.04857","version":1},"attestation_state":"computed","paper":{"title":"Mutually Exclusive Modules in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2015-06-16T07:09:05Z","abstract_excerpt":"Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \\& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \\& D_1$ -- $exec(D_0 \\& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive mod"},"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":"1506.04857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"a2962dca18ca7c8378b382d0c614fa20f7b6edfd74f3f020dbf030b45260ae98","abstract_canon_sha256":"93bd4edcde248a484bb7955aad5e73bbedf1b556d3c5c63515b810056a2731c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.713603Z","signature_b64":"UF5N3BGXfEJAx0S09pxp8zfp6gV6mKspzKV+oaPD1c5eMh/1B9LSeo2iOkUsCfUc6meA4hRri8vHytuk3C8ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","last_reissued_at":"2026-05-18T01:48:05.713068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.713068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutually Exclusive Modules in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2015-06-16T07:09:05Z","abstract_excerpt":"Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \\& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \\& D_1$ -- $exec(D_0 \\& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04857","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":"1506.04857","created_at":"2026-05-18T01:48:05.713156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04857v1","created_at":"2026-05-18T01:48:05.713156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04857","created_at":"2026-05-18T01:48:05.713156+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJWAYGZ6WI5Q","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJWAYGZ6WI5QHKR4","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJWAYGZ6","created_at":"2026-05-18T12:29:29.992203+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/KJWAYGZ6WI5QHKR4DQT7UIPIM4","json":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4.json","graph_json":"https://pith.science/api/pith-number/KJWAYGZ6WI5QHKR4DQT7UIPIM4/graph.json","events_json":"https://pith.science/api/pith-number/KJWAYGZ6WI5QHKR4DQT7UIPIM4/events.json","paper":"https://pith.science/paper/KJWAYGZ6"},"agent_actions":{"view_html":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4","download_json":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4.json","view_paper":"https://pith.science/paper/KJWAYGZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04857&json=true","fetch_graph":"https://pith.science/api/pith-number/KJWAYGZ6WI5QHKR4DQT7UIPIM4/graph.json","fetch_events":"https://pith.science/api/pith-number/KJWAYGZ6WI5QHKR4DQT7UIPIM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/action/storage_attestation","attest_author":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/action/author_attestation","sign_citation":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/action/citation_signature","submit_replication":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/action/replication_record"}},"created_at":"2026-05-18T01:48:05.713156+00:00","updated_at":"2026-05-18T01:48:05.713156+00:00"}