{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZFFDLK4YMDMA3K67ROHK24T7KC","short_pith_number":"pith:ZFFDLK4Y","schema_version":"1.0","canonical_sha256":"c94a35ab9860d80dabdf8b8ead727f509e3970e492392fa329352011cecfc2a8","source":{"kind":"arxiv","id":"1701.03615","version":3},"attestation_state":"computed","paper":{"title":"Towards a Decidable LogicWeb via Length-Bounded Derivations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daeseong Kang, Keehang Kwon","submitted_at":"2017-01-13T10:27:46Z","abstract_excerpt":"LogicWeb has traditionally lacked devices for dealing with intractable queries.\n  We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form $prov(P,G,n)$ which is a success if a query $G$ can be proved from the web page $P$ within $n$ proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we propose a novel module language for logic programming as a device for structuring programs and queries."},"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":"1701.03615","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-13T10:27:46Z","cross_cats_sorted":[],"title_canon_sha256":"732d4d8a89537bb93a0f410814014fb96f52bd4a4f3c9b5943690d8013241dd8","abstract_canon_sha256":"269506963ef5d2e0569ece76b965787b38b1c41f0ee146d393f61ebf87250d58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:36.333555Z","signature_b64":"yub8uo2eAxyMmem7AFVPIJm5r32K5bhsuXb+0+symncfxUxVI6mRSZ4Ngx+Vp+kD0EV/n0Km3M0HDg7+xMT5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94a35ab9860d80dabdf8b8ead727f509e3970e492392fa329352011cecfc2a8","last_reissued_at":"2026-05-18T00:32:36.332960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:36.332960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Decidable LogicWeb via Length-Bounded Derivations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daeseong Kang, Keehang Kwon","submitted_at":"2017-01-13T10:27:46Z","abstract_excerpt":"LogicWeb has traditionally lacked devices for dealing with intractable queries.\n  We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form $prov(P,G,n)$ which is a success if a query $G$ can be proved from the web page $P$ within $n$ proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we propose a novel module language for logic programming as a device for structuring programs and queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03615","kind":"arxiv","version":3},"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":"1701.03615","created_at":"2026-05-18T00:32:36.333047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03615v3","created_at":"2026-05-18T00:32:36.333047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03615","created_at":"2026-05-18T00:32:36.333047+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFFDLK4YMDMA","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFFDLK4YMDMA3K67","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFFDLK4Y","created_at":"2026-05-18T12:31:59.375834+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/ZFFDLK4YMDMA3K67ROHK24T7KC","json":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC.json","graph_json":"https://pith.science/api/pith-number/ZFFDLK4YMDMA3K67ROHK24T7KC/graph.json","events_json":"https://pith.science/api/pith-number/ZFFDLK4YMDMA3K67ROHK24T7KC/events.json","paper":"https://pith.science/paper/ZFFDLK4Y"},"agent_actions":{"view_html":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC","download_json":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC.json","view_paper":"https://pith.science/paper/ZFFDLK4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03615&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFFDLK4YMDMA3K67ROHK24T7KC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFFDLK4YMDMA3K67ROHK24T7KC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC/action/storage_attestation","attest_author":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC/action/author_attestation","sign_citation":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC/action/citation_signature","submit_replication":"https://pith.science/pith/ZFFDLK4YMDMA3K67ROHK24T7KC/action/replication_record"}},"created_at":"2026-05-18T00:32:36.333047+00:00","updated_at":"2026-05-18T00:32:36.333047+00:00"}