{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZXSETEEQHDEYVJIAA3UO2NHG5W","short_pith_number":"pith:ZXSETEEQ","schema_version":"1.0","canonical_sha256":"cde449909038c98aa50006e8ed34e6ed8c20c3a221bddc3597694e91d9b36a7a","source":{"kind":"arxiv","id":"1504.06374","version":1},"attestation_state":"computed","paper":{"title":"Logical Conditional Preference Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrea Loreggia, Cristina Cornelio, Vijay Saraswat","submitted_at":"2015-04-24T02:07:36Z","abstract_excerpt":"CP-nets represent the dominant existing framework for expressing qualitative conditional preferences between alternatives, and are used in a variety of areas including constraint solving. Over the last fifteen years, a significant literature has developed exploring semantics, algorithms, implementation and use of CP-nets. This paper introduces a comprehensive new framework for conditional preferences: logical conditional preference theories (LCP theories). To express preferences, the user specifies arbitrary (constraint) Datalog programs over a binary ordering relation on outcomes. We show how"},"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":"1504.06374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-24T02:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"ba9ab89183155dcc11dafcecabe01b46236872aa886370c2175790d37dbc2194","abstract_canon_sha256":"6d8424029ff75b2682f970c8a790bd6291d62057859ecd1a1c4509c1b068aa9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:53.832185Z","signature_b64":"hVmLbyqSqzW0w+9LD59VBfvCLIlXmEzTs6iONGLh9O0dZy7RLQdRkr4l/vKdMf3nwdmJfBFranwsYsIq9ISnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde449909038c98aa50006e8ed34e6ed8c20c3a221bddc3597694e91d9b36a7a","last_reissued_at":"2026-05-18T02:17:53.831592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:53.831592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Conditional Preference Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrea Loreggia, Cristina Cornelio, Vijay Saraswat","submitted_at":"2015-04-24T02:07:36Z","abstract_excerpt":"CP-nets represent the dominant existing framework for expressing qualitative conditional preferences between alternatives, and are used in a variety of areas including constraint solving. Over the last fifteen years, a significant literature has developed exploring semantics, algorithms, implementation and use of CP-nets. This paper introduces a comprehensive new framework for conditional preferences: logical conditional preference theories (LCP theories). To express preferences, the user specifies arbitrary (constraint) Datalog programs over a binary ordering relation on outcomes. We show how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06374","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":"1504.06374","created_at":"2026-05-18T02:17:53.831662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06374v1","created_at":"2026-05-18T02:17:53.831662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06374","created_at":"2026-05-18T02:17:53.831662+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXSETEEQHDEY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXSETEEQHDEYVJIA","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXSETEEQ","created_at":"2026-05-18T12:29:52.810259+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/ZXSETEEQHDEYVJIAA3UO2NHG5W","json":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W.json","graph_json":"https://pith.science/api/pith-number/ZXSETEEQHDEYVJIAA3UO2NHG5W/graph.json","events_json":"https://pith.science/api/pith-number/ZXSETEEQHDEYVJIAA3UO2NHG5W/events.json","paper":"https://pith.science/paper/ZXSETEEQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W","download_json":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W.json","view_paper":"https://pith.science/paper/ZXSETEEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06374&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXSETEEQHDEYVJIAA3UO2NHG5W/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXSETEEQHDEYVJIAA3UO2NHG5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W/action/storage_attestation","attest_author":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W/action/author_attestation","sign_citation":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W/action/citation_signature","submit_replication":"https://pith.science/pith/ZXSETEEQHDEYVJIAA3UO2NHG5W/action/replication_record"}},"created_at":"2026-05-18T02:17:53.831662+00:00","updated_at":"2026-05-18T02:17:53.831662+00:00"}