Extracting and Following Paths for Robust Relational Reasoning with Large Language Models

arXiv cs.CL / 3/25/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces Path-of-Thoughts (PoT), a framework designed to improve LLM performance on relational reasoning tasks like kinship and spatial reasoning by structuring the problem into multiple stages.
  • PoT first extracts a reasoning graph to identify key entities, relations, and attributes, then selects query-relevant reasoning paths, and finally performs reasoning over those candidate paths.
  • Experiments on four relational reasoning datasets show PoT outperforms prior state-of-the-art baselines by up to 21.3% while avoiding fine-tuning and using fewer/extensible LLM calls.
  • The approach claims robustness advantages over earlier neuro-symbolic methods, including better resilience to LLM extraction errors and input ambiguity through the compositional properties of graphs.

Abstract

Large language models (LLMs) possess vast semantic knowledge but often struggle with complex reasoning tasks, particularly in relational reasoning problems such as kinship or spatial reasoning. In this paper, we present Path-of-Thoughts (PoT), a novel framework for solving relation reasoning that decomposes the task into three key stages: graph extraction, path identification, and reasoning. Unlike previous approaches, PoT efficiently extracts a reasoning graph that identifies crucial entities, relations, and attributes within the context. Subsequently, PoT identifies query-relevant reasoning paths within the graph, facilitating downstream reasoning of potential answers. Experimental evaluations across four datasets of relational reasoning demonstrate that PoT surpasses state-of-the-art baselines by a significant margin (up to 21.3%) without requiring fine-tuning or extensive LLM calls. Furthermore, unlike prior neuro-symbolic methods, PoT exhibits improved resilience against LLM extraction errors and input ambiguity by leveraging the compositional nature of graphs.