{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:576QUX224UMACCJRIW77INSMM4","short_pith_number":"pith:576QUX22","schema_version":"1.0","canonical_sha256":"effd0a5f5ae51801093145bff4364c67008cc26d2c4c15868df29c05238588a8","source":{"kind":"arxiv","id":"cs/0604054","version":4},"attestation_state":"computed","paper":{"title":"New results on rewrite-based satisfiability procedures","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz","submitted_at":"2006-04-12T19:53:24Z","abstract_excerpt":"Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficie"},"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/0604054","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2006-04-12T19:53:24Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6c4b00e71cc022fc48de50ada71d5a3a3757a6f3f871f5d1083d01c1c6e1f3cd","abstract_canon_sha256":"92587cefff528f1c4111a306e606bc71f8cc0f05e3e6f1a7b934d26240083213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:29.893687Z","signature_b64":"1jOdT8IwCZ4Rm80tEnvKajTABqxqjWZMCLtNftjmb3f6jm5aKTWBL7/ZJi0BSavww/mPD7PJNWX1kclzbibgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effd0a5f5ae51801093145bff4364c67008cc26d2c4c15868df29c05238588a8","last_reissued_at":"2026-05-18T02:27:29.892936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:29.892936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New results on rewrite-based satisfiability procedures","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz","submitted_at":"2006-04-12T19:53:24Z","abstract_excerpt":"Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604054","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":"cs/0604054","created_at":"2026-05-18T02:27:29.893051+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0604054v4","created_at":"2026-05-18T02:27:29.893051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604054","created_at":"2026-05-18T02:27:29.893051+00:00"},{"alias_kind":"pith_short_12","alias_value":"576QUX224UMA","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"576QUX224UMACCJR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"576QUX22","created_at":"2026-05-18T12:25:53.939244+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/576QUX224UMACCJRIW77INSMM4","json":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4.json","graph_json":"https://pith.science/api/pith-number/576QUX224UMACCJRIW77INSMM4/graph.json","events_json":"https://pith.science/api/pith-number/576QUX224UMACCJRIW77INSMM4/events.json","paper":"https://pith.science/paper/576QUX22"},"agent_actions":{"view_html":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4","download_json":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4.json","view_paper":"https://pith.science/paper/576QUX22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0604054&json=true","fetch_graph":"https://pith.science/api/pith-number/576QUX224UMACCJRIW77INSMM4/graph.json","fetch_events":"https://pith.science/api/pith-number/576QUX224UMACCJRIW77INSMM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4/action/storage_attestation","attest_author":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4/action/author_attestation","sign_citation":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4/action/citation_signature","submit_replication":"https://pith.science/pith/576QUX224UMACCJRIW77INSMM4/action/replication_record"}},"created_at":"2026-05-18T02:27:29.893051+00:00","updated_at":"2026-05-18T02:27:29.893051+00:00"}