{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OT7MQVEQZM6HZLDSEUCBZFJ5MS","short_pith_number":"pith:OT7MQVEQ","schema_version":"1.0","canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","source":{"kind":"arxiv","id":"1405.3365","version":1},"attestation_state":"computed","paper":{"title":"A Well-Founded Semantics for FOL-Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jia-Huai You, Yi Bi, Zhiyong Feng","submitted_at":"2014-05-14T05:29:40Z","abstract_excerpt":"An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics suppor"},"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":"1405.3365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"bafb2b11e24e440730dca3f4be04b74d477eda0a3711ca45db3866786347c1b5","abstract_canon_sha256":"3530ce1b2fe3e5a622bb4f2453ccf2e6f4eca8e06e6819c413bad38af911a32a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.242595Z","signature_b64":"9H+FEPj5s9m8mj4GM3Xp/Ojj/gK5p8oejVGBFLlMEM7EdhsBuICkf2Xl4gR9ADZKMyXb7+2AIiD6dQGcr5Y9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","last_reissued_at":"2026-05-18T02:51:56.242061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.242061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Well-Founded Semantics for FOL-Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jia-Huai You, Yi Bi, Zhiyong Feng","submitted_at":"2014-05-14T05:29:40Z","abstract_excerpt":"An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics suppor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3365","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":"1405.3365","created_at":"2026-05-18T02:51:56.242143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3365v1","created_at":"2026-05-18T02:51:56.242143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3365","created_at":"2026-05-18T02:51:56.242143+00:00"},{"alias_kind":"pith_short_12","alias_value":"OT7MQVEQZM6H","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OT7MQVEQZM6HZLDS","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OT7MQVEQ","created_at":"2026-05-18T12:28:43.426989+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/OT7MQVEQZM6HZLDSEUCBZFJ5MS","json":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS.json","graph_json":"https://pith.science/api/pith-number/OT7MQVEQZM6HZLDSEUCBZFJ5MS/graph.json","events_json":"https://pith.science/api/pith-number/OT7MQVEQZM6HZLDSEUCBZFJ5MS/events.json","paper":"https://pith.science/paper/OT7MQVEQ"},"agent_actions":{"view_html":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS","download_json":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS.json","view_paper":"https://pith.science/paper/OT7MQVEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3365&json=true","fetch_graph":"https://pith.science/api/pith-number/OT7MQVEQZM6HZLDSEUCBZFJ5MS/graph.json","fetch_events":"https://pith.science/api/pith-number/OT7MQVEQZM6HZLDSEUCBZFJ5MS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/action/storage_attestation","attest_author":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/action/author_attestation","sign_citation":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/action/citation_signature","submit_replication":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/action/replication_record"}},"created_at":"2026-05-18T02:51:56.242143+00:00","updated_at":"2026-05-18T02:51:56.242143+00:00"}