{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BHXCFLF6H7PCDN26724OTYAF7L","short_pith_number":"pith:BHXCFLF6","schema_version":"1.0","canonical_sha256":"09ee22acbe3fde21b75efeb8e9e005faeb7fdc5c3677edb1da21a6bce358c46f","source":{"kind":"arxiv","id":"2305.15541","version":1},"attestation_state":"computed","paper":{"title":"Harnessing the Power of Large Language Models for Natural Language to First-Order Logic Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ali Payani, Ehsan Shareghi, Faramarz Fekri, Siheng Xiong, Yuan Yang","submitted_at":"2023-05-24T19:59:51Z","abstract_excerpt":"Translating natural language sentences to first-order logic (NL-FOL translation) is a longstanding challenge in the NLP and formal logic literature. This paper introduces LogicLLaMA, a LLaMA-7B model fine-tuned for NL-FOL translation using LoRA on a single GPU. LogicLLaMA is capable of directly translating natural language into FOL rules, which outperforms GPT-3.5. LogicLLaMA is also equipped to correct FOL rules predicted by GPT-3.5, and can achieve similar performance as GPT-4 with a fraction of the cost. This correction ability was achieved by a novel supervised fine-tuning (SFT) + reinforc"},"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":"2305.15541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-24T19:59:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3e5df33135e588dfdd597ce5c126c0c0aa65320aeaa07ff182ed9af74baf40d1","abstract_canon_sha256":"b37b999e177bd23ee2baed534739c276abba6439ed92700a41e73cf027ef81a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:41.760111Z","signature_b64":"ggEPnayf8Jxa6I1bfjNedk9tPv4cWFdBKNJlLRRx/AZ/QmZ2rVsfWH/fHFEdDmAieeQQG/LzYtLUYFYAyAmXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09ee22acbe3fde21b75efeb8e9e005faeb7fdc5c3677edb1da21a6bce358c46f","last_reissued_at":"2026-07-05T06:13:41.759665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:41.759665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harnessing the Power of Large Language Models for Natural Language to First-Order Logic Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ali Payani, Ehsan Shareghi, Faramarz Fekri, Siheng Xiong, Yuan Yang","submitted_at":"2023-05-24T19:59:51Z","abstract_excerpt":"Translating natural language sentences to first-order logic (NL-FOL translation) is a longstanding challenge in the NLP and formal logic literature. This paper introduces LogicLLaMA, a LLaMA-7B model fine-tuned for NL-FOL translation using LoRA on a single GPU. LogicLLaMA is capable of directly translating natural language into FOL rules, which outperforms GPT-3.5. LogicLLaMA is also equipped to correct FOL rules predicted by GPT-3.5, and can achieve similar performance as GPT-4 with a fraction of the cost. This correction ability was achieved by a novel supervised fine-tuning (SFT) + reinforc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15541","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.15541/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.15541","created_at":"2026-07-05T06:13:41.759723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15541v1","created_at":"2026-07-05T06:13:41.759723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15541","created_at":"2026-07-05T06:13:41.759723+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHXCFLF6H7PC","created_at":"2026-07-05T06:13:41.759723+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHXCFLF6H7PCDN26","created_at":"2026-07-05T06:13:41.759723+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHXCFLF6","created_at":"2026-07-05T06:13:41.759723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.16118","citing_title":"Know Your Limits : On the Faithfulness of LLMs as Solvers and Autoformalizers in Legal Reasoning","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07925","citing_title":"ROSUM-MCTS: Monte Carlo Tree Search-Inspired HDL Code Summarization with Structural Rewards","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2509.24765","citing_title":"Semantic-Aware Logical Reasoning via a Semiotic Framework","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18873","citing_title":"From Natural Language to Executable Narsese: A Neuro-Symbolic Benchmark and Pipeline for Reasoning with NARS","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L","json":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L.json","graph_json":"https://pith.science/api/pith-number/BHXCFLF6H7PCDN26724OTYAF7L/graph.json","events_json":"https://pith.science/api/pith-number/BHXCFLF6H7PCDN26724OTYAF7L/events.json","paper":"https://pith.science/paper/BHXCFLF6"},"agent_actions":{"view_html":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L","download_json":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L.json","view_paper":"https://pith.science/paper/BHXCFLF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15541&json=true","fetch_graph":"https://pith.science/api/pith-number/BHXCFLF6H7PCDN26724OTYAF7L/graph.json","fetch_events":"https://pith.science/api/pith-number/BHXCFLF6H7PCDN26724OTYAF7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L/action/storage_attestation","attest_author":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L/action/author_attestation","sign_citation":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L/action/citation_signature","submit_replication":"https://pith.science/pith/BHXCFLF6H7PCDN26724OTYAF7L/action/replication_record"}},"created_at":"2026-07-05T06:13:41.759723+00:00","updated_at":"2026-07-05T06:13:41.759723+00:00"}