{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:AQDHT2KV2DHCGNRARNW6WOTFMM","short_pith_number":"pith:AQDHT2KV","schema_version":"1.0","canonical_sha256":"040679e955d0ce2336208b6deb3a65632bc1493eb73e54391d1daa8287c44709","source":{"kind":"arxiv","id":"0808.3884","version":4},"attestation_state":"computed","paper":{"title":"The Complexity of Reasoning for Fragments of Default Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Arne Meier, Heribert Vollmer, Michael Thomas, Olaf Beyersdorff","submitted_at":"2008-08-28T11:14:41Z","abstract_excerpt":"Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\\SigmaPtwo$-complete, and the complexity of the credulous and skeptical reasoning problem as SigmaP2-complete, resp. PiP2-complete. Additionally, he investigated restrictions on the default rules, i.e., semi-normal default rules. Selman made in 1992 a similar approach with disjunction-free and unary default rules. In this paper we systematically restrict the set of allowed propositional connectives. We give a complete complexity class"},"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":"0808.3884","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-08-28T11:14:41Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b47b643a884d88c3675f82067787b3235552245ae6c7285ddbc7cf04b3145c80","abstract_canon_sha256":"cd427476e5cacacc208ae280bb97e863ba65560a05eb29616754c83d73be99bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.082967Z","signature_b64":"DVWLxWD04T/h4px4uc20WkHkMe54VCDC7FmW+IApC5Z/SqVa3ETDdBVOinxBCZvula8Qsl879NA/ep8ApkIKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"040679e955d0ce2336208b6deb3a65632bc1493eb73e54391d1daa8287c44709","last_reissued_at":"2026-05-18T04:42:02.082497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.082497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Reasoning for Fragments of Default Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Arne Meier, Heribert Vollmer, Michael Thomas, Olaf Beyersdorff","submitted_at":"2008-08-28T11:14:41Z","abstract_excerpt":"Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\\SigmaPtwo$-complete, and the complexity of the credulous and skeptical reasoning problem as SigmaP2-complete, resp. PiP2-complete. Additionally, he investigated restrictions on the default rules, i.e., semi-normal default rules. Selman made in 1992 a similar approach with disjunction-free and unary default rules. In this paper we systematically restrict the set of allowed propositional connectives. We give a complete complexity class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3884","kind":"arxiv","version":4},"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":"0808.3884","created_at":"2026-05-18T04:42:02.082572+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.3884v4","created_at":"2026-05-18T04:42:02.082572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3884","created_at":"2026-05-18T04:42:02.082572+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQDHT2KV2DHC","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQDHT2KV2DHCGNRA","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQDHT2KV","created_at":"2026-05-18T12:25:56.245647+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/AQDHT2KV2DHCGNRARNW6WOTFMM","json":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM.json","graph_json":"https://pith.science/api/pith-number/AQDHT2KV2DHCGNRARNW6WOTFMM/graph.json","events_json":"https://pith.science/api/pith-number/AQDHT2KV2DHCGNRARNW6WOTFMM/events.json","paper":"https://pith.science/paper/AQDHT2KV"},"agent_actions":{"view_html":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM","download_json":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM.json","view_paper":"https://pith.science/paper/AQDHT2KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.3884&json=true","fetch_graph":"https://pith.science/api/pith-number/AQDHT2KV2DHCGNRARNW6WOTFMM/graph.json","fetch_events":"https://pith.science/api/pith-number/AQDHT2KV2DHCGNRARNW6WOTFMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM/action/storage_attestation","attest_author":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM/action/author_attestation","sign_citation":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM/action/citation_signature","submit_replication":"https://pith.science/pith/AQDHT2KV2DHCGNRARNW6WOTFMM/action/replication_record"}},"created_at":"2026-05-18T04:42:02.082572+00:00","updated_at":"2026-05-18T04:42:02.082572+00:00"}