{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3T5FJYZM3DZU4HTPNZGLWRT4HA","short_pith_number":"pith:3T5FJYZM","schema_version":"1.0","canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","source":{"kind":"arxiv","id":"1804.09007","version":1},"attestation_state":"computed","paper":{"title":"Solving Horn Clauses on Inductive Data Types Without Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, University G. D'Annunzio of Chieti-Pescara, University of Rome Tor Vergata","submitted_at":"2018-04-24T13:20:25Z","abstract_excerpt":"We address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Vi"},"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":"1804.09007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"18df9985659a9219b412cd4650da9d39f9702adc79357d67b83fac605785e416","abstract_canon_sha256":"8290c9183f3892a5ab42c84e919f00f9af6828160482d22011a4f3eebcd6076a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.976345Z","signature_b64":"YRnMUmCcT4dcoCGNlONgDkWnruLlhTjtuOdWPVSHptRWFNXnXsSHbCO6u7S4tldasce55o0TCG15iOpoTx8HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","last_reissued_at":"2026-05-18T00:02:44.975829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.975829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Horn Clauses on Inductive Data Types Without Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, University G. D'Annunzio of Chieti-Pescara, University of Rome Tor Vergata","submitted_at":"2018-04-24T13:20:25Z","abstract_excerpt":"We address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09007","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":"1804.09007","created_at":"2026-05-18T00:02:44.975908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09007v1","created_at":"2026-05-18T00:02:44.975908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09007","created_at":"2026-05-18T00:02:44.975908+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T5FJYZM3DZU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T5FJYZM3DZU4HTP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T5FJYZM","created_at":"2026-05-18T12:32:05.422762+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/3T5FJYZM3DZU4HTPNZGLWRT4HA","json":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA.json","graph_json":"https://pith.science/api/pith-number/3T5FJYZM3DZU4HTPNZGLWRT4HA/graph.json","events_json":"https://pith.science/api/pith-number/3T5FJYZM3DZU4HTPNZGLWRT4HA/events.json","paper":"https://pith.science/paper/3T5FJYZM"},"agent_actions":{"view_html":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA","download_json":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA.json","view_paper":"https://pith.science/paper/3T5FJYZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09007&json=true","fetch_graph":"https://pith.science/api/pith-number/3T5FJYZM3DZU4HTPNZGLWRT4HA/graph.json","fetch_events":"https://pith.science/api/pith-number/3T5FJYZM3DZU4HTPNZGLWRT4HA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/action/storage_attestation","attest_author":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/action/author_attestation","sign_citation":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/action/citation_signature","submit_replication":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/action/replication_record"}},"created_at":"2026-05-18T00:02:44.975908+00:00","updated_at":"2026-05-18T00:02:44.975908+00:00"}