Skip to content
Book Open access

Exploration-and-Thinking: Agentic Reasoning over Knowledge Graphs via an LLM-RL Synergized Framework

Jul 2026 · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval · pp. 2049-2060 · 0 citations · 37 references
Computer Science

TL;DR

EAT (Exploration-and-Thinking), a novel agentic framework that synergizes LLMs with Reinforcement Learning (RL) for efficient and faithful reasoning on KGs, which surpasses the reasoning capability of GPT-4o while utilizing a significantly smaller 8B-parameter LLM.

Abstract

While Knowledge Graphs (KGs) can ground Large Language Models (LLMs) in factual knowledge, existing LLM-KG integration methods for complex reasoning are plagued by computational inefficiency and semantic inconsistency. The tight coupling of LLM inference and KG traversal leads to prohibitive costs, while spurious reasoning paths often misguide learning-based agents, causing reward hacking. To this end, we propose EAT (Exploration-and-Thinking), a novel agentic framework that synergizes LLMs with Reinforcement Learning (RL) for efficient and faithful reasoning on KGs. EAT's core innovations are twofold: (1) an adaptive retrieval-augmented generation mechanism that decouples language comprehension from structured exploration, dramatically improving efficiency; and (2) an LLM-guided reward shaping strategy that explicitly penalizes semantically inconsistent paths and promotes logically valid trajectories grounded in the KG. Extensive experiments on benchmarks like WebQSP, CWQ, and GrailQA show that EAT achieves state-of-the-art performance. Notably, it surpasses the reasoning capability of GPT-4o while utilizing a significantly smaller 8B-parameter LLM.

Read PDF

Similar papers

#artificial intelligence Preprint Aug 2026

RACER: Reinforced Agent Collaboration for Explainable Reasoning on Knowledge Graphs

RACER employs a semantic-aware action pruning and teacher-guided reinforcement learning mechanism to efficiently extract high-quality reasoning pathways from large-scale KGs, and introduces a cross-task accumulated shared memory graph paired with an attention-driven multi-path knowledge refinement module.

Yuwei Lou, Hao Hu, Yu-Zhou Jiang et al. · 0 citations
2026

EcoReason: A Graph-Guided Evolutionary and Negative-Aware Reinforcement Learning Framework for LLM Commonsense Reasoning

While large language models (LLMs) have achieved impressive gains in commonsense reasoning, they often fall into “associative shortcuts,” failing to distinguish correct answers from plausible but constraint-violating hard negatives. This reliance on semantic priors rather than specific situational constraints limits th...

Xin Guan, Jiu-Xin Cao, Biwei Cao et al. · 0 citations
Preprint Aug 2026

Structure-Internalized Rule Language Model for Faithful Knowledge Graph Reasoning

A Structure-Internalized Rule Language Model (SIRLM) is proposed, which centers on structural rule generation to couple the parametric learning of structural knowledge with the faithfulness evaluation of reasoning logic, enabling LLMs to anchor tightly to KG-grounded evidence.

Xingrui Zhuo, Jia-Pu Wang, Manzong Huang et al. · 0 citations
#natural language process... Preprint Sep 2026

Explore-on-Graph: Hybrid Embedding-LLM Reasoning for Knowledge Graph Question Answering under Incompleteness

Large language models (LLMs) are increasingly combined with knowledge graphs (KGs) to ground reasoning in structured evidence. However, most LLM-based KGQA methods rely on traversing existing graph edges and become unreliable when reasoning paths are broken by missing facts. Alternatives that ask LLMs to generate missi...

Ola El Khatib, D. Difallah · 0 citations
Preprint Aug 2026

ChainPrune: Evaluating and Reducing Redundancy in Long Chain-of-Thought Reasoning

This work proposes ChainPrune, a novel reasoning path semantic structural optimization method to efficiently and controllably synthesize self-generated high-quality training data and incorporates a DPO-based preference learning method combined with supervised loss, effectively mitigating false reward suppression.

Weihang Pan, Zhengxu Yu, Yuxiang Zhang et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.