{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YZGGEUU3OKEG2I46OY3PCYSI47","short_pith_number":"pith:YZGGEUU3","schema_version":"1.0","canonical_sha256":"c64c62529b72886d239e7636f16248e7c64f49a97cee5f0efd5df718e29c2a0e","source":{"kind":"arxiv","id":"1203.3466","version":1},"attestation_state":"computed","paper":{"title":"Possibilistic Answer Set Programming Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dirk Vermeir, Kim Bauters, Martine De Cock, Steven Schockaert","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP"},"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":"1203.3466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"7d71272d4633f3290715784a46cd74a8b2048b4432280f4b773f8355cf1ea6e1","abstract_canon_sha256":"a55fe88687cf105f29ccb74f75026caefa4f7458f9341a7dda346548f9daccc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.531494Z","signature_b64":"CigyancQ+QLgynSjqPadkqVDxkWuyoAJizXS6oq3LwNVUjsM4MQtqbUBcOyRRFU4ebKxnkEBrQ7Tg7lHh+qyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c64c62529b72886d239e7636f16248e7c64f49a97cee5f0efd5df718e29c2a0e","last_reissued_at":"2026-05-18T04:00:00.530783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.530783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Possibilistic Answer Set Programming Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dirk Vermeir, Kim Bauters, Martine De Cock, Steven Schockaert","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3466","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":"1203.3466","created_at":"2026-05-18T04:00:00.530888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3466v1","created_at":"2026-05-18T04:00:00.530888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3466","created_at":"2026-05-18T04:00:00.530888+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZGGEUU3OKEG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZGGEUU3OKEG2I46","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZGGEUU3","created_at":"2026-05-18T12:27:30.460161+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/YZGGEUU3OKEG2I46OY3PCYSI47","json":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47.json","graph_json":"https://pith.science/api/pith-number/YZGGEUU3OKEG2I46OY3PCYSI47/graph.json","events_json":"https://pith.science/api/pith-number/YZGGEUU3OKEG2I46OY3PCYSI47/events.json","paper":"https://pith.science/paper/YZGGEUU3"},"agent_actions":{"view_html":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47","download_json":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47.json","view_paper":"https://pith.science/paper/YZGGEUU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3466&json=true","fetch_graph":"https://pith.science/api/pith-number/YZGGEUU3OKEG2I46OY3PCYSI47/graph.json","fetch_events":"https://pith.science/api/pith-number/YZGGEUU3OKEG2I46OY3PCYSI47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47/action/storage_attestation","attest_author":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47/action/author_attestation","sign_citation":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47/action/citation_signature","submit_replication":"https://pith.science/pith/YZGGEUU3OKEG2I46OY3PCYSI47/action/replication_record"}},"created_at":"2026-05-18T04:00:00.530888+00:00","updated_at":"2026-05-18T04:00:00.530888+00:00"}