Challenge: Natural logic reasoning has received increasing attention lately, with several datasets and neural models proposed, though with limited success.
Approach: They propose to iteratively perform 1-step neural inferences and chain together the results to generate a multi-step reasoning trace.
Outcome: The proposed method has high accuracies on a multi-hop First-Order Logic (FOL) reasoning benchmark.

Similar Papers

Multi-Step Inference for Reasoning Over Paragraphs (2020.emnlp-main)

Copied to clipboard

Challenge: Existing models for complex reasoning use symbols or black-box transformers . a compositional model can chain together free-form predicates and logical connectives .
Approach: They propose a compositional model that finds relevant sentences and then chains them together using neural modules.
Outcome: The proposed model improves performance on a recently-introduced dataset.
Enhancing Transformers for Generalizable First-Order Logical Entailment (2025.acl-long)

Copied to clipboard

Challenge: Moreover, transformers have demonstrated proficiency in logical reasoning over natural language.
Approach: They propose a logic-aware architecture that improves the performance in generalizable first-order logical entailment by combining distribution shifts and unseen knowledge.
Outcome: The proposed architecture outperforms methods designed specifically for knowledge graph query answering on a dataset with a large dataset.
GRACE: Discriminator-Guided Chain-of-Thought Reasoning (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing language models (LMs) can assign a high likelihood to incorrect steps . Existing models (LLMs), however, struggle with complex multi-step reasoning.
Approach: They propose a stepwise decoding approach that steers the decoding process towards producing correct reasoning steps.
Outcome: The proposed approach outperforms existing methods on math and symbolic reasoning tasks.
FOL-Traces: Verified First-Order Logic Reasoning Traces at Scale (2026.findings-eacl)

Copied to clipboard

Challenge: Existing approaches to evaluate language models fail to provide structural clarity and verifiable inference.
Approach: They propose to use a large-scale dataset of programmatically verified reasoning traces to evaluate structured logical inference.
Outcome: The proposed model achieves 45.7% accuracy on masked operation prediction and 27% on two-step completion.
Neuro-Symbolic Integration Brings Causal and Reliable Reasoning Proofs (2025.findings-naacl)

Copied to clipboard

Challenge: a new framework for complex reasoning with LLMs is developed to improve reasoning proof accuracy and interpretability.
Approach: They propose to use LLMs to generate search logs that can be interpreted into human-readable reasoning proofs.
Outcome: The proposed framework improves reasoning accuracy but lacks interpretability due to black-box nature of the solvers.
Explainable Chain-of-Thought Reasoning: An Empirical Analysis on State-Aware Reasoning Dynamics (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in chain-of-thought prompting have demonstrated the ability of large language models to perform multi-step reasoning.
Approach: They propose a framework to analyze latent dynamics of CoT trajectories for interpretability . they segment generated CoT into discrete reasoning steps and abstract each step into a spectral embedding based on token-level Gram matrices .
Outcome: The proposed framework segments generated CoT steps into discrete reasoning steps, abstracts each step into a spectral embedding based on token-level Gram matrices, and clusters these embeddements into semantically meaningful latent states.
Unravelling the Logic: Investigating the Generalisation of Transformers in Numerical Satisfiability Problems (2025.acl-long)

Copied to clipboard

Challenge: Transformer models exhibit minimal scale and noise invariance, along with limited vocabulary and number invariancy.
Approach: They probe the generalisation prowess of Transformer models with respect to the hitherto unexplored domain of numerical satisfiability problems.
Outcome: The proposed models exhibit minimal scale and noise invariance, along with limited vocabulary and number invariancy.
From Query to Logic: Ontology-Driven Multi-Hop Reasoning in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) exhibit limitations in complex multi-hop question answering tasks that necessitate non-linear, structured reasoning.
Approach: They propose an ontology-driven reasoning and chain framework that combines LLMs’ generative capabilities with the structural benefits of knowledge graphs.
Outcome: Extensive experiments across a diverse set of models and standard MQA benchmarks demonstrate that the proposed framework achieves competitive performance while producing more interpretable reasoning chains.
Neural Unification for Logic Reasoning over Natural Language (2021.findings-emnlp)

Copied to clipboard

Challenge: Automated Theorem Proving (ATP) is a computer program that can show that conjectures are logical consequences of a set of axioms.
Approach: They propose a transformer-based architecture for deriving conjectures given axioms . they propose 'neural unifier' and relative training procedure to train the model .
Outcome: The proposed architectures are able to answer queries with deep queries with a relatively low training time.
Verifying the Steps of Deductive Reasoning Chains (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models have been shown to improve the reasoning capabilities of the models.
Approach: They propose to automate verification of individual reasoning steps in a logical deductive Chain-of-Thought.
Outcome: The proposed method can detect unsound reasoning steps fairly well, but under-performs symbolic methods.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations