{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AK3ZC5X6NNPEIBMKEY2NMCZAXV","short_pith_number":"pith:AK3ZC5X6","schema_version":"1.0","canonical_sha256":"02b79176fe6b5e44058a2634d60b20bd51509fc52706b5816c5cd3d1252d09a6","source":{"kind":"arxiv","id":"1507.07228","version":2},"attestation_state":"computed","paper":{"title":"Combining Fixed-Point Definitions and Game Semantics in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Keehang Kwon","submitted_at":"2015-07-26T17:55:30Z","abstract_excerpt":"Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability.\n  We extend the operational semantics of these languages with game semantics. This extended semantics has several interesting aspects: in particular, it gives a logical status to the $read$ predicate."},"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":"1507.07228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-26T17:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"44705c43547c7ac9daec0ed56f80ca4f5d85043178953c2f484f1d4a5d197d5e","abstract_canon_sha256":"02237b08cac6d9f2a128be36690cdb7d12a091ff07b57b0c6182a40dec6f64d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:44.459366Z","signature_b64":"VT637M/j5d/6SKn2oUo0isUOiG/TTSo9TgO5FHZjbBrXG+4ATxkchKQIvFqrOH3T0QbDKUwaQp855Z3+6WBqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02b79176fe6b5e44058a2634d60b20bd51509fc52706b5816c5cd3d1252d09a6","last_reissued_at":"2026-05-18T01:35:44.458900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:44.458900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Fixed-Point Definitions and Game Semantics in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Keehang Kwon","submitted_at":"2015-07-26T17:55:30Z","abstract_excerpt":"Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability.\n  We extend the operational semantics of these languages with game semantics. This extended semantics has several interesting aspects: in particular, it gives a logical status to the $read$ predicate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07228","kind":"arxiv","version":2},"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":"1507.07228","created_at":"2026-05-18T01:35:44.458977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07228v2","created_at":"2026-05-18T01:35:44.458977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07228","created_at":"2026-05-18T01:35:44.458977+00:00"},{"alias_kind":"pith_short_12","alias_value":"AK3ZC5X6NNPE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AK3ZC5X6NNPEIBMK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AK3ZC5X6","created_at":"2026-05-18T12:29:10.953037+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/AK3ZC5X6NNPEIBMKEY2NMCZAXV","json":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV.json","graph_json":"https://pith.science/api/pith-number/AK3ZC5X6NNPEIBMKEY2NMCZAXV/graph.json","events_json":"https://pith.science/api/pith-number/AK3ZC5X6NNPEIBMKEY2NMCZAXV/events.json","paper":"https://pith.science/paper/AK3ZC5X6"},"agent_actions":{"view_html":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV","download_json":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV.json","view_paper":"https://pith.science/paper/AK3ZC5X6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07228&json=true","fetch_graph":"https://pith.science/api/pith-number/AK3ZC5X6NNPEIBMKEY2NMCZAXV/graph.json","fetch_events":"https://pith.science/api/pith-number/AK3ZC5X6NNPEIBMKEY2NMCZAXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV/action/storage_attestation","attest_author":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV/action/author_attestation","sign_citation":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV/action/citation_signature","submit_replication":"https://pith.science/pith/AK3ZC5X6NNPEIBMKEY2NMCZAXV/action/replication_record"}},"created_at":"2026-05-18T01:35:44.458977+00:00","updated_at":"2026-05-18T01:35:44.458977+00:00"}