{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UTSHMSAX4X3FTB2S3EUIIJ4RSM","short_pith_number":"pith:UTSHMSAX","schema_version":"1.0","canonical_sha256":"a4e4764817e5f6598752d928842791933b3b2ee1fc3f64c0bffdbaec7b2646e5","source":{"kind":"arxiv","id":"1109.3256","version":1},"attestation_state":"computed","paper":{"title":"Non-termination Analysis of Logic Programs with Integer arithmetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Danny De Schreye, Dean Voets","submitted_at":"2011-09-15T03:58:37Z","abstract_excerpt":"In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at ICLP 2009. The analysis starts from a class of queries and infer"},"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":"1109.3256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-15T03:58:37Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1c38a2c8d583050fbdb37e06c9b76651b3eda6c5f1264251bccb669e33e4945a","abstract_canon_sha256":"1ee47f718e4e940e9436d4888d5898b1c1c72a2e3a739b121ce3d4e94ead8351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:57.157422Z","signature_b64":"lxALtSZIx0BroKDT0116COWriuwLVatkhN7q3VKfaYdX20q4SVMHmeKi23vqVvd+1JQqgs28aASuKpngCfJLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4e4764817e5f6598752d928842791933b3b2ee1fc3f64c0bffdbaec7b2646e5","last_reissued_at":"2026-05-18T04:12:57.156972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:57.156972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-termination Analysis of Logic Programs with Integer arithmetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Danny De Schreye, Dean Voets","submitted_at":"2011-09-15T03:58:37Z","abstract_excerpt":"In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at ICLP 2009. The analysis starts from a class of queries and infer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3256","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":"1109.3256","created_at":"2026-05-18T04:12:57.157039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3256v1","created_at":"2026-05-18T04:12:57.157039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3256","created_at":"2026-05-18T04:12:57.157039+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTSHMSAX4X3F","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTSHMSAX4X3FTB2S","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTSHMSAX","created_at":"2026-05-18T12:26:42.757692+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/UTSHMSAX4X3FTB2S3EUIIJ4RSM","json":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM.json","graph_json":"https://pith.science/api/pith-number/UTSHMSAX4X3FTB2S3EUIIJ4RSM/graph.json","events_json":"https://pith.science/api/pith-number/UTSHMSAX4X3FTB2S3EUIIJ4RSM/events.json","paper":"https://pith.science/paper/UTSHMSAX"},"agent_actions":{"view_html":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM","download_json":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM.json","view_paper":"https://pith.science/paper/UTSHMSAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3256&json=true","fetch_graph":"https://pith.science/api/pith-number/UTSHMSAX4X3FTB2S3EUIIJ4RSM/graph.json","fetch_events":"https://pith.science/api/pith-number/UTSHMSAX4X3FTB2S3EUIIJ4RSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM/action/storage_attestation","attest_author":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM/action/author_attestation","sign_citation":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM/action/citation_signature","submit_replication":"https://pith.science/pith/UTSHMSAX4X3FTB2S3EUIIJ4RSM/action/replication_record"}},"created_at":"2026-05-18T04:12:57.157039+00:00","updated_at":"2026-05-18T04:12:57.157039+00:00"}