{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T6SP5ECQY4H32C3VI63SL7STOI","short_pith_number":"pith:T6SP5ECQ","schema_version":"1.0","canonical_sha256":"9fa4fe9050c70fbd0b7547b725fe53723fb52c0c625224930a0ae86500de9844","source":{"kind":"arxiv","id":"1811.11435","version":1},"attestation_state":"computed","paper":{"title":"Partial Evaluation of Logic Programs in Vector Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chiaki Sakama, Hien D. Nguyen, Katsumi Inoue, Taisuke Sato","submitted_at":"2018-11-28T08:24:03Z","abstract_excerpt":"In this paper, we introduce methods of encoding propositional logic programs in vector spaces. Interpretations are represented by vectors and programs are represented by matrices. The least model of a definite program is computed by multiplying an interpretation vector and a program matrix. To optimize computation in vector spaces, we provide a method of partial evaluation of programs using linear algebra. Partial evaluation is done by unfolding rules in a program, and it is realized in a vector space by multiplying program matrices. We perform experiments using randomly generated programs and"},"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":"1811.11435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-28T08:24:03Z","cross_cats_sorted":[],"title_canon_sha256":"b3be64c76ac3b06c2087c23c2a5ec02118f1d4ef1f82e191113606140e52c8dc","abstract_canon_sha256":"f5c5aaa826aed2081a9b7a644716bd9554b940ec862f8474a0bab638e337c3c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:42.970714Z","signature_b64":"4tcMHR3hLuqUqatPhylzibWFiGKJLKKHyDuQ1RddGzCwakDhYvvhSsK1zk/Ix8q3gKLOrtcroA81cMAO7gMLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fa4fe9050c70fbd0b7547b725fe53723fb52c0c625224930a0ae86500de9844","last_reissued_at":"2026-05-17T23:59:42.970222Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:42.970222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Evaluation of Logic Programs in Vector Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chiaki Sakama, Hien D. Nguyen, Katsumi Inoue, Taisuke Sato","submitted_at":"2018-11-28T08:24:03Z","abstract_excerpt":"In this paper, we introduce methods of encoding propositional logic programs in vector spaces. Interpretations are represented by vectors and programs are represented by matrices. The least model of a definite program is computed by multiplying an interpretation vector and a program matrix. To optimize computation in vector spaces, we provide a method of partial evaluation of programs using linear algebra. Partial evaluation is done by unfolding rules in a program, and it is realized in a vector space by multiplying program matrices. We perform experiments using randomly generated programs and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11435","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":"1811.11435","created_at":"2026-05-17T23:59:42.970298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11435v1","created_at":"2026-05-17T23:59:42.970298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11435","created_at":"2026-05-17T23:59:42.970298+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6SP5ECQY4H3","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6SP5ECQY4H32C3V","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6SP5ECQ","created_at":"2026-05-18T12:32:53.628368+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/T6SP5ECQY4H32C3VI63SL7STOI","json":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI.json","graph_json":"https://pith.science/api/pith-number/T6SP5ECQY4H32C3VI63SL7STOI/graph.json","events_json":"https://pith.science/api/pith-number/T6SP5ECQY4H32C3VI63SL7STOI/events.json","paper":"https://pith.science/paper/T6SP5ECQ"},"agent_actions":{"view_html":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI","download_json":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI.json","view_paper":"https://pith.science/paper/T6SP5ECQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11435&json=true","fetch_graph":"https://pith.science/api/pith-number/T6SP5ECQY4H32C3VI63SL7STOI/graph.json","fetch_events":"https://pith.science/api/pith-number/T6SP5ECQY4H32C3VI63SL7STOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI/action/storage_attestation","attest_author":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI/action/author_attestation","sign_citation":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI/action/citation_signature","submit_replication":"https://pith.science/pith/T6SP5ECQY4H32C3VI63SL7STOI/action/replication_record"}},"created_at":"2026-05-17T23:59:42.970298+00:00","updated_at":"2026-05-17T23:59:42.970298+00:00"}