Tree-of-Traversals: A Zero-Shot Reasoning Algorithm for Augmenting Black-box Language Models with Knowledge Graphs (2024.acl-long)
Copied to clipboard
Elan Markowitz, Anil Ramakrishna, Jwala Dhamala, Ninareh Mehrabi, Charith Peris, Rahul Gupta, Kai-Wei Chang, Aram Galstyan
| Challenge: | Knowledge graphs (KGs) complement Large Language Models (LLMs) by providing reliable, structured, domain-specific, and up-to-date external knowledge. |
| Approach: | They propose a zero-shot reasoning algorithm that augments black-box LLMs with one or more KGs. |
| Outcome: | The proposed algorithm significantly improves performance on question answering and KG question answering tasks. |
Similar Papers
The Role of Exploration Modules in Small Language Models for Knowledge Graph Question Answering (2025.acl-srw)
Copied to clipboard
| Challenge: | Existing methods to integrate knowledge graphs into large language models often rely on proprietary or extremely large models . |
| Approach: | They propose to integrate knowledge graphs into reasoning processes of large language models . they propose to use simple and efficient exploration modules to handle knowledge graph traversal . |
| Outcome: | The proposed modules improve the performance of small language models on knowledge graph question answering tasks. |
ReKG-MCTS: Reinforcing LLM Reasoning on Knowledge Graphs via Training-Free Monte Carlo Tree Search (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to combining knowledge graphs with large language models face limitations in path exploration strategies or excessive computational overhead. |
| Approach: | They propose a training-free framework that synergizes Monte Carlo Tree Search with LLM capabilities to enable dynamic reasoning over KGs. |
| Outcome: | The proposed framework outperforms existing training-free methods and achieves competitive performance compared to fine-tuned baselines. |
Reasoning with Trees: Faithful Question Answering over Knowledge Graph (2025.coling-main)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have shown remarkable progress in reasoning capabilities, yet they still face challenges in complex, multi-step reasoning tasks. |
| Approach: | They propose a framework that synergistically integrates LLMs with knowledge graphs (KGs) to enhance reasoning performance and interpretability. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on two benchmark KGQA datasets and improves on the MCTS process. |
KG-GPT: A General Framework for Reasoning on Knowledge Graphs Using Large Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Using large language models for complex reasoning tasks on knowledge graphs remains unexplored. |
| Approach: | They propose a multi-purpose framework leveraging large language models for complex reasoning tasks on knowledge graphs. |
| Outcome: | The proposed framework outperforms fully-supervised models in KG-based fact verification and KGQA benchmarks. |
Fact Finder - Enhancing Domain Expertise of Large Language Models by Incorporating Knowledge Graphs (2026.eacl-demo)
Copied to clipboard
Daniel Steinigen, Roman Teucher, Timm Heine Ruland, Max Rudat, Nicolas Flores-Herr, Peter Fischer, Nikola Milosevic, Christopher Schymura, Angelo Ziletti
| Challenge: | Recent advances in Large Language Models have demonstrated their proficiency in answering natural language queries. |
| Approach: | They propose a system that augments Large Language Models with domain-specific knowledge graphs . they evaluate a medical KG and use a KG-based retrieval approach to enhance factual correctness . |
| Outcome: | The proposed system surpasses a standalone LLM in accuracy and completeness on a medical KG dataset. |
Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent studies focus on performance benchmarks without fully comparing LLMs to graph learning models. |
| Approach: | They evaluate off-the-shelf and instruction-tuned graph learning models across a variety of scenarios. |
| Outcome: | The proposed models outperform traditional graph learning models in few-shot settings, the authors show . their models out perform models with instruction tuning, and they show excellent generalization and robustness. |
Tree-KG: An Expandable Knowledge Graph Construction Framework for Knowledge-intensive Domains (2025.acl-long)
Copied to clipboard
| Challenge: | Knowledge graphs are a useful tool for organizing complex data in knowledge-intensive domains. |
| Approach: | They propose an expandable framework that combines structured domain texts with advanced semantic techniques to create a tree-like graph from textbooks. |
| Outcome: | The proposed framework surpasses competing methods in the text-Annotated dataset with high scores on the Text-Annalytated data. |
Split-Merge: Scalable and Memory-Efficient Merging of Expert LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | a zero-shot merging framework for large language models consolidates specialized domain experts into a single model without any further training. |
| Approach: | They propose a zero-shot merging framework that consolidates specialized domain experts into a single model without further training. |
| Outcome: | Experiments on code generation, mathematical reasoning, medical question answering, and instruction-following benchmarks confirm the versatility and effectiveness of the proposed framework. |
Augmenting Reasoning Capabilities of LLMs with Graph Structures in Knowledge Base Question Answering (2024.findings-emnlp)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Hao Wang, Jun Yang, Jing Xu, Ruanmin Cao, HaoYu Wang
| Challenge: | Recent work uses Large Language Models (LLMs) for semantic parsing to address Knowledge Base Question Answering tasks. |
| Approach: | They propose a framework that augments reasoning capabilities of LLMs with Graph Structures in Knowledge Base Question Answering to retrieve question-related graph structures. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and WebQSP under the few-shot setting. |
Graph-R1: Incentivizing the Zero-Shot Graph Learning Capability in LLMs via Explicit Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Large Reasoning Models (LLMs) provide a zero-shot alternative via explicit, long chain-of-thought reasoning. |
| Approach: | They propose a GNN-free approach that reformulates graph tasks as textual reasoning problems solved by LRMs. |
| Outcome: | The proposed approach outperforms state-of-the-art baselines in zero-shot settings, producing interpretable and effective predictions. |