{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:U2VOQAFTEKEAEMLW2B566E7RQB","short_pith_number":"pith:U2VOQAFT","schema_version":"1.0","canonical_sha256":"a6aae800b32288023176d07bef13f1805ea25a673589072a228acb823f221732","source":{"kind":"arxiv","id":"cs/0511055","version":1},"attestation_state":"computed","paper":{"title":"Embedding Defeasible Logic into Logic Programming","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher","submitted_at":"2005-11-15T10:39:38Z","abstract_excerpt":"Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches.\n  In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, th"},"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/0511055","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-11-15T10:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"ea73598062f0f1b6ca21298e4fcce64fa15ba5c1a23c1668d704cca881682456","abstract_canon_sha256":"c275a0dabd9996ab6155ec712be42da67a6ce531f016506a323745f86868841b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:39.170536Z","signature_b64":"nP/mlrY789pwHTC4mihQ6GceuuiY/Acnm01nbqdmbizGrNzuQqQ51tAWWh/ynZoxXNEU9PD0Il8s/nApvVRDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6aae800b32288023176d07bef13f1805ea25a673589072a228acb823f221732","last_reissued_at":"2026-05-18T03:52:39.169815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:39.169815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Defeasible Logic into Logic Programming","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher","submitted_at":"2005-11-15T10:39:38Z","abstract_excerpt":"Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches.\n  In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511055","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/0511055","created_at":"2026-05-18T03:52:39.169916+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0511055v1","created_at":"2026-05-18T03:52:39.169916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511055","created_at":"2026-05-18T03:52:39.169916+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2VOQAFTEKEA","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2VOQAFTEKEAEMLW","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2VOQAFT","created_at":"2026-05-18T12:25:53.335082+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/U2VOQAFTEKEAEMLW2B566E7RQB","json":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB.json","graph_json":"https://pith.science/api/pith-number/U2VOQAFTEKEAEMLW2B566E7RQB/graph.json","events_json":"https://pith.science/api/pith-number/U2VOQAFTEKEAEMLW2B566E7RQB/events.json","paper":"https://pith.science/paper/U2VOQAFT"},"agent_actions":{"view_html":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB","download_json":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB.json","view_paper":"https://pith.science/paper/U2VOQAFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0511055&json=true","fetch_graph":"https://pith.science/api/pith-number/U2VOQAFTEKEAEMLW2B566E7RQB/graph.json","fetch_events":"https://pith.science/api/pith-number/U2VOQAFTEKEAEMLW2B566E7RQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB/action/storage_attestation","attest_author":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB/action/author_attestation","sign_citation":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB/action/citation_signature","submit_replication":"https://pith.science/pith/U2VOQAFTEKEAEMLW2B566E7RQB/action/replication_record"}},"created_at":"2026-05-18T03:52:39.169916+00:00","updated_at":"2026-05-18T03:52:39.169916+00:00"}