{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HFGR7UIEXX4WU6LHPGPHVPVKVL","short_pith_number":"pith:HFGR7UIE","schema_version":"1.0","canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","source":{"kind":"arxiv","id":"1108.5794","version":1},"attestation_state":"computed","paper":{"title":"A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christoph Beierle, Gabriele Kern-Isberner, Karl S\\\"odler","submitted_at":"2011-08-30T01:41:34Z","abstract_excerpt":"In order to give appropriate semantics to qualitative conditionals of the form \"if A then normally B\", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming techniques for solving this constraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; these minim"},"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":"1108.5794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"49e8cf41513bdd3ee5783b2376e9e3beebc4c240743824b28b925455d989e7b5","abstract_canon_sha256":"e08192646991d3e2e58fa287147183467b5c85843fb09b3c6b937e76bd4436d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.596378Z","signature_b64":"HKKf6aCov43wMuXmVjKppmKdbUTk+PPeBwklTDs3eeOsBXIWhf/V2dtlsfmhAoR7WGJukPC2PgiZ9MM191QaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","last_reissued_at":"2026-05-18T04:14:28.595817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.595817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christoph Beierle, Gabriele Kern-Isberner, Karl S\\\"odler","submitted_at":"2011-08-30T01:41:34Z","abstract_excerpt":"In order to give appropriate semantics to qualitative conditionals of the form \"if A then normally B\", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming techniques for solving this constraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; these minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5794","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":"1108.5794","created_at":"2026-05-18T04:14:28.595899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5794v1","created_at":"2026-05-18T04:14:28.595899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5794","created_at":"2026-05-18T04:14:28.595899+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFGR7UIEXX4W","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFGR7UIEXX4WU6LH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFGR7UIE","created_at":"2026-05-18T12:26:30.835961+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/HFGR7UIEXX4WU6LHPGPHVPVKVL","json":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL.json","graph_json":"https://pith.science/api/pith-number/HFGR7UIEXX4WU6LHPGPHVPVKVL/graph.json","events_json":"https://pith.science/api/pith-number/HFGR7UIEXX4WU6LHPGPHVPVKVL/events.json","paper":"https://pith.science/paper/HFGR7UIE"},"agent_actions":{"view_html":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL","download_json":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL.json","view_paper":"https://pith.science/paper/HFGR7UIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5794&json=true","fetch_graph":"https://pith.science/api/pith-number/HFGR7UIEXX4WU6LHPGPHVPVKVL/graph.json","fetch_events":"https://pith.science/api/pith-number/HFGR7UIEXX4WU6LHPGPHVPVKVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/action/storage_attestation","attest_author":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/action/author_attestation","sign_citation":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/action/citation_signature","submit_replication":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/action/replication_record"}},"created_at":"2026-05-18T04:14:28.595899+00:00","updated_at":"2026-05-18T04:14:28.595899+00:00"}