Challenge: Existing approaches to solve non-deterministic reasoning problems in large language models are limited by their complexity and lack of a clear understanding of the problem.
Approach: They propose a method to diagnose and correct non-deterministic reasoning behaviors in large language models.
Outcome: The proposed method outperforms baselines and WebQSP benchmarks on the widely used WebQ SP and CWQ benchmarks.

Similar Papers

Right for Right Reasons: Large Language Models for Verifiable Commonsense Knowledge Graph Question Answering (2024.emnlp-main)

Copied to clipboard

Challenge: Existing Knowledge Graph Question Answering (KGQA) methods focus on answering factual questions, leaving questions involving commonsense reasoning unaddressed.
Approach: They propose a commonsense KGQA methodology that axiomatically surfaces commonsensical knowledge of Large Language Models and grounding every factual reasoning step on KG triples.
Outcome: The proposed method outperforms existing methods and reduces instances of hallucination and reasoning errors.
PO-KGQA: Preference Optimization for Low-Resource Complex Knowledge Graph Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing low-resource in-context learning-based knowledge graph question answering methods rely heavily on large language models to convert natural language questions into logical forms.
Approach: They propose a low-resource in-context learning-based knowledge graph question answering (KGQA) that uses large language models to convert a natural language question into its corresponding logical form.
Outcome: The proposed method outperforms other methods on complex benchmarks by approximately 9% (avg).
Generate-on-Graph: Treat LLM as both Agent and KG for Incomplete Knowledge Graph Question Answering (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to integrate LLMs with Knowledge Graphs (KGs) however, these methods are often incomplete to cover all the knowledge required to answer questions.
Approach: They propose to integrate LLMs with Knowledge Graphs (KGs) to address insufficient knowledge and hallucination issues in Large Language Models.
Outcome: The proposed method outperforms existing methods on two datasets.
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning.
Approach: They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning.
Outcome: Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines.
Advancing Abductive Reasoning in Knowledge Graphs through Complex Logical Hypothesis Generation (2024.acl-long)

Copied to clipboard

Challenge: Abductive reasoning is the process of making educated guesses to provide explanations for observations.
Approach: They propose a task of complex logical hypothesis generation to generate a complex logique hypothesis that can explain a set of observations.
Outcome: The proposed model generates logical hypotheses closer to the reference hypothesis, but not better on unseen observations.
Thought-Action Graph Reasoning: Faithful and Efficient Reasoning of Large Language Models via Reusing Past Experience (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for integrating knowledge graphs with LLMs suffer from poor generalization or low reasoning efficiency.
Approach: They propose a thought-action Graph (TAG) that decomposes LLM-KG interaction trajectories into fine-grained semantic operators and guides LLM to execute on them.
Outcome: The proposed paradigm outperforms state-of-the-art methods on KGQA benchmarks while reducing the number of LLM calls and generated tokens.
LLM as Prompter: Low-resource Inductive Reasoning on Arbitrary Knowledge Graphs (2024.findings-acl)

Copied to clipboard

Challenge: Knowledge Graph (KG) inductive reasoning is widely adopted in various applications.
Approach: They propose a framework for low-resource inductive reasoning using Large Language Models to generate a graph-structural prompt for pre-trained KGs.
Outcome: The proposed framework outperforms previous methods in three-shot, one-shot and zero-shot reasoning tasks.
A Collaborative Reasoning Framework Powered by Reinforcement Learning and Large Language Models for Complex Questions Answering over Knowledge Graph (2025.coling-main)

Copied to clipboard

Challenge: Knowledge Graph Question Answering (KGQA) aims to answer natural language questions by reasoning across multiple triples in knowledge graphs.
Approach: They propose a collaborative reasoning framework powered by RL and LLMs to answer complex questions based on the knowledge graph.
Outcome: The proposed model surpasses state-of-the-art models on four datasets.
Rule-KBQA: Rule-Guided Reasoning for Complex Knowledge Base Question Answering with Large Language Models (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for knowledge base question answering lack grammaticality, faithfulness, and controllability due to hallucinations in the reasoning process.
Approach: They propose a framework that employs learned rules to guide the generation of logical forms.
Outcome: The proposed method achieves competitive results on standard KBQA datasets.
Out-of-Context Reasoning in Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: a lightweight technique trains only new token embeddings on axioms and evaluates them on unseen tasks.
Approach: They propose a lightweight technique that trains only new token embeddings on axioms . they train only new embeddables and evaluate them on unseen tasks .
Outcome: The proposed technique trains only new token embeddings on axioms and evaluates them on unseen tasks.

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