{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:H63NURVB2ELNS5OV4ZE7VAVLAF","short_pith_number":"pith:H63NURVB","schema_version":"1.0","canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","source":{"kind":"arxiv","id":"cs/0702072","version":1},"attestation_state":"computed","paper":{"title":"Logic Programming with Satisfiability","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Michael Codish, Peter J. Stuckey, Vitaly Lagoon","submitted_at":"2007-02-13T03:10:02Z","abstract_excerpt":"This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT."},"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":"cs/0702072","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2007-02-13T03:10:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"60457cbd3f35c083f9cd36030601851b2445f281902629e9398545859c6dd3bf","abstract_canon_sha256":"f41c9f22ea010dbfbb1aa97b86fc4326b3592489085ab216588080600a718471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.387863Z","signature_b64":"SFnTHDNGwmf9kbWh4R2Wb/tBZmR+7sqvYbJThNcXTDhWqAtBY3gVQJpkTiDkW9Dr+TqDRJ635ANTrCXY+kSGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb6da46a1d116d975d5e649fa82ab0150703ee886305bf24a2af82a2c9803da","last_reissued_at":"2026-05-18T04:41:26.387250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.387250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logic Programming with Satisfiability","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Michael Codish, Peter J. Stuckey, Vitaly Lagoon","submitted_at":"2007-02-13T03:10:02Z","abstract_excerpt":"This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702072","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":"cs/0702072","created_at":"2026-05-18T04:41:26.387330+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0702072v1","created_at":"2026-05-18T04:41:26.387330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702072","created_at":"2026-05-18T04:41:26.387330+00:00"},{"alias_kind":"pith_short_12","alias_value":"H63NURVB2ELN","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"H63NURVB2ELNS5OV","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"H63NURVB","created_at":"2026-05-18T12:25:55.427421+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/H63NURVB2ELNS5OV4ZE7VAVLAF","json":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF.json","graph_json":"https://pith.science/api/pith-number/H63NURVB2ELNS5OV4ZE7VAVLAF/graph.json","events_json":"https://pith.science/api/pith-number/H63NURVB2ELNS5OV4ZE7VAVLAF/events.json","paper":"https://pith.science/paper/H63NURVB"},"agent_actions":{"view_html":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF","download_json":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF.json","view_paper":"https://pith.science/paper/H63NURVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0702072&json=true","fetch_graph":"https://pith.science/api/pith-number/H63NURVB2ELNS5OV4ZE7VAVLAF/graph.json","fetch_events":"https://pith.science/api/pith-number/H63NURVB2ELNS5OV4ZE7VAVLAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/action/storage_attestation","attest_author":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/action/author_attestation","sign_citation":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/action/citation_signature","submit_replication":"https://pith.science/pith/H63NURVB2ELNS5OV4ZE7VAVLAF/action/replication_record"}},"created_at":"2026-05-18T04:41:26.387330+00:00","updated_at":"2026-05-18T04:41:26.387330+00:00"}