{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OJKE2YAON7GD7ESIUOEGNRVGTE","short_pith_number":"pith:OJKE2YAO","schema_version":"1.0","canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","source":{"kind":"arxiv","id":"1907.10389","version":1},"attestation_state":"computed","paper":{"title":"Inconsistency Proofs for ASP: The ASP-DRUPE Format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Carmine Dodaro, Jakob Rath, Johannes K. Fichte, Mario Alviano, Markus Hecher, Tobias Philipp","submitted_at":"2019-07-24T12:32:37Z","abstract_excerpt":"Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develop the new proof format ASP-DRUPE for propositional, disjunctive logic programs, inclu"},"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":"1907.10389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-24T12:32:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eadea5ab865e7a73d89e33644d2997b2423a260c35dcc7cc44bd2c03cbf9872a","abstract_canon_sha256":"a09b9f397a56aa286501d6128e257982f92bb6a30d334523211518a5a6c02fa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.073836Z","signature_b64":"N7YrfraWu6ZRw7KLkqP3c1GxJ6ddhtDFtIeNdplMwtzvtkAUjhU0Q2HTmZMzHtEMRD1YGr7T43PUl3Co9p7qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72544d600e6fcc3f9248a38866c6a6993ad726ae2e4039526f03e0408f04acb3","last_reissued_at":"2026-05-17T23:39:38.073312Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.073312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inconsistency Proofs for ASP: The ASP-DRUPE Format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Carmine Dodaro, Jakob Rath, Johannes K. Fichte, Mario Alviano, Markus Hecher, Tobias Philipp","submitted_at":"2019-07-24T12:32:37Z","abstract_excerpt":"Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develop the new proof format ASP-DRUPE for propositional, disjunctive logic programs, inclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10389","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":"1907.10389","created_at":"2026-05-17T23:39:38.073414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10389v1","created_at":"2026-05-17T23:39:38.073414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10389","created_at":"2026-05-17T23:39:38.073414+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJKE2YAON7GD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJKE2YAON7GD7ESI","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJKE2YAO","created_at":"2026-05-18T12:33:24.271573+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/OJKE2YAON7GD7ESIUOEGNRVGTE","json":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE.json","graph_json":"https://pith.science/api/pith-number/OJKE2YAON7GD7ESIUOEGNRVGTE/graph.json","events_json":"https://pith.science/api/pith-number/OJKE2YAON7GD7ESIUOEGNRVGTE/events.json","paper":"https://pith.science/paper/OJKE2YAO"},"agent_actions":{"view_html":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE","download_json":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE.json","view_paper":"https://pith.science/paper/OJKE2YAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10389&json=true","fetch_graph":"https://pith.science/api/pith-number/OJKE2YAON7GD7ESIUOEGNRVGTE/graph.json","fetch_events":"https://pith.science/api/pith-number/OJKE2YAON7GD7ESIUOEGNRVGTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/action/storage_attestation","attest_author":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/action/author_attestation","sign_citation":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/action/citation_signature","submit_replication":"https://pith.science/pith/OJKE2YAON7GD7ESIUOEGNRVGTE/action/replication_record"}},"created_at":"2026-05-17T23:39:38.073414+00:00","updated_at":"2026-05-17T23:39:38.073414+00:00"}