{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W367UVK3GJY2LWPRKWWMP6XPT7","short_pith_number":"pith:W367UVK3","schema_version":"1.0","canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","source":{"kind":"arxiv","id":"1511.06668","version":1},"attestation_state":"computed","paper":{"title":"Solving non-linear Horn clauses using a linear solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bishoksan Kafle","submitted_at":"2015-11-20T16:22:02Z","abstract_excerpt":"Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The program transformation is based on the notion of tree dimension, which we apply to trees corresponding to Horn clause derivations. The dimension of a tree is a measure of its non-linearity -- for example a "},"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":"1511.06668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","cross_cats_sorted":[],"title_canon_sha256":"e04d91ffc247d7a14b2b7785bf9d0723763610d7182c847c7a6f6919c5762828","abstract_canon_sha256":"6d3281cc9ebdb80090e8ace6ddad51444bdbc905717563c9e4e7315881b642cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.102069Z","signature_b64":"E3htWXHGp8O8gtDq2mf42tNJga8DeDQ2iui2TUlAOzOICoPImhmnAP0/WzdIFGvZsML7zH9W2KHyFJQcmSDlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","last_reissued_at":"2026-05-18T01:26:24.101619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.101619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving non-linear Horn clauses using a linear solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bishoksan Kafle","submitted_at":"2015-11-20T16:22:02Z","abstract_excerpt":"Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The program transformation is based on the notion of tree dimension, which we apply to trees corresponding to Horn clause derivations. The dimension of a tree is a measure of its non-linearity -- for example a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06668","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":"1511.06668","created_at":"2026-05-18T01:26:24.101683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06668v1","created_at":"2026-05-18T01:26:24.101683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06668","created_at":"2026-05-18T01:26:24.101683+00:00"},{"alias_kind":"pith_short_12","alias_value":"W367UVK3GJY2","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W367UVK3GJY2LWPR","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W367UVK3","created_at":"2026-05-18T12:29:47.479230+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/W367UVK3GJY2LWPRKWWMP6XPT7","json":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7.json","graph_json":"https://pith.science/api/pith-number/W367UVK3GJY2LWPRKWWMP6XPT7/graph.json","events_json":"https://pith.science/api/pith-number/W367UVK3GJY2LWPRKWWMP6XPT7/events.json","paper":"https://pith.science/paper/W367UVK3"},"agent_actions":{"view_html":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7","download_json":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7.json","view_paper":"https://pith.science/paper/W367UVK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06668&json=true","fetch_graph":"https://pith.science/api/pith-number/W367UVK3GJY2LWPRKWWMP6XPT7/graph.json","fetch_events":"https://pith.science/api/pith-number/W367UVK3GJY2LWPRKWWMP6XPT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/action/storage_attestation","attest_author":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/action/author_attestation","sign_citation":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/action/citation_signature","submit_replication":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/action/replication_record"}},"created_at":"2026-05-18T01:26:24.101683+00:00","updated_at":"2026-05-18T01:26:24.101683+00:00"}