Parsing Natural Language into Propositional and First-Order Logic with Dual Reinforcement Learning (2022.coling-1)
Copied to clipboard
Xuantao Lu, Jingping Liu, Zhouhong Gu, Hanwen Tong, Chenhao Xie, Junyang Huang, Yanghua Xiao, Wenguang Wang
| Challenge: | Existing methods to parse natural language into structured logical expressions have limitations due to paucity of labeled data. |
| Approach: | They propose a scoring model to automatically learn a model-based reward . they also propose introducing a Chinese-PL/FOL dataset to compensate for paucity of labeled data . |
| Outcome: | The proposed model outperforms competitors on several datasets. |
Similar Papers
Semantic Parsing with Dual Learning (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to parse natural language queries are limited by lack of labeled data and constrained decoding. |
| Approach: | They propose a semantic parsing framework with the dual learning algorithm that makes full use of data through a dual-learning game. |
| Outcome: | The proposed approach achieves state-of-the-art performance on ATIS dataset and gets competitive performance on overnight dataset. |
Harnessing the Power of Large Language Models for Natural Language to First-Order Logic Translation (2024.acl-long)
Copied to clipboard
| Challenge: | Logic-based approaches to reasoning have lost popularity due to limited scalability and coverage. |
| Approach: | They present a dataset of 28K sentence-level NL-FOL pairs from GPT4 and a LogicLLaMA2-7B/13B fine-tuned on MALLS for NL translation. |
| Outcome: | The proposed model can be used standalone or to correct previously generated rules by GPT3.5. |
Entailment-Preserving First-order Logic Representations in Natural Language Entailment (2025.acl-long)
Copied to clipboard
| Challenge: | First-order logic (FOL) is often used to represent logical entailment, but determining natural language (NL) enanglement using FOL remains a challenge. |
| Approach: | They propose an Entailment-Preserving FOL representations task and a method which trains an NL-to-FOL translator by using the natural language entailment labels as verifiable rewards. |
| Outcome: | The proposed method achieves 1.8–2.7% improvement in EPR and 17.4–20.6% increase in E PR@16 compared to baselines in three datasets. |
Interactive Semantic Parsing with Reinforcement Learning for Knowledge Graph Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to improve LLM reliability rely on factual hallucinations . Existing methods rely only on graph traversal, resulting in imprecise retrieval and heavy post-processing burdens. |
| Approach: | They propose a framework that integrates knowledge Graphs as structured, high-fidelity buffers to enhance LLM reliability. |
| Outcome: | The proposed framework allows logical constraints to be dynamically interleaved with graph search while optimizing via reinforcement learning with only final answer feedback eliminates the need for gold program annotations. |
Enhancing Reinforcement Learning with Label-Sensitive Reward for Natural Language Understanding (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have yielded remarkable performance, but objective mismatch issues hinder RLHF learning. |
| Approach: | They propose a Reinforcement Learning framework enhanced with Label-sensitive reward to enhance LLMs' alignment and generation capabilities. |
| Outcome: | The proposed framework improves performance on five diverse models across eight tasks. |
NL2Lean: Translating Natural Language into Lean 4 through Multi-Aspect Reinforcement Learning (2025.emnlp-main)
Copied to clipboard
Yue Fang, Shaohan Huang, Xin Yu, Haizhen Huang, Zihan Zhang, Weiwei Deng, Furu Wei, Feng Sun, Qi Zhang, Zhi Jin
| Challenge: | Existing formal proof assistants rely on instruction tuning and lack fine-grained structural and semantic alignment. |
| Approach: | They propose a reinforcement learning framework that enables LLMs to translate natural language into formal language such as Lean 4 . they use a model with basic translation ability to refine the model's reinforcement learning . |
| Outcome: | The proposed method outperforms baseline models on NL-to-Lean 4 tasks. |
NL2Logic: AST-Guided Translation of Natural Language into First-Order Logic with Large Language Models (2026.findings-eacl)
Copied to clipboard
| Challenge: | Structured reasoning approaches that parse first-order logic rules from natural language lack syntax control and semantic faithfulness. |
| Approach: | They propose a structured reasoning paradigm that parses first-order logic rules from natural language and delegates inference to automated solvers. |
| Outcome: | a proposed framework parses first-order logic rules from natural language and delegates inference to automated solvers. |
Few-Shot Natural Language to First-Order Logic Translation via Code Generation (2025.naacl-long)
Copied to clipboard
| Challenge: | Recent studies have focused on translation of natural language to first-order logical formula (NL-FOL) but these methods face challenges such as inconsistency between training and inference phases and data-intensive finetuning process. |
| Approach: | They propose a method for translating natural language into first-order logical formulas using code snippets. |
| Outcome: | The proposed method surpasses training-free baselines and is comparable to supervised models trained on the full training data. |
Summary Level Training of Sentence Rewriting for Abstractive Summarization (D19-54)
Copied to clipboard
| Challenge: | Existing models rely on sentence-level rewards or suboptimal labels to achieve summary-level ROUGE scores. |
| Approach: | They propose a model that extracts salient sentences from a document and paraphrases them to generate a summary. |
| Outcome: | The proposed model improves on CNN/Daily Mail and New York Times datasets. |
Dual Inference for Improving Language Understanding and Generation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies have exploited the duality of the task pairs in machine translation and speech recognition. |
| Approach: | They propose to leverage the duality in the inference stage without retraining whole models. |
| Outcome: | The proposed method is effective in both NLU and NLG tasks, providing the great potential of practical use. |