Papers with WebQSP
CompKBQA: Component-wise Task Decomposition for Knowledge Base Question Answering (2025.emnlp-main)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Pan Yang, Changzhi Zhou, Jun Yang, Hao Wang, Huipeng Ma, Chenhao Li, Luan Zhang
| Challenge: | Existing knowledge base question answering methods struggle with complex queries. |
| Approach: | They propose a framework that optimizes the process of fine-tuning a LLM for generating logical forms by enabling it to learn relevant sub-tasks like skeleton generation, topic entity generation, and relevant relations generation. |
| Outcome: | The proposed framework achieves state-of-the-art on two benchmark KBQA datasets, WebQSP and CWQ. |
UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering (N19-1)
Copied to clipboard
| Challenge: | Existing work restricts search from one entity to another to the maximum number of hops . a knowledge graph is a powerful graph structure that encodes knowledge to save and organize it . |
| Approach: | They propose an unrestricted-hop framework which relaxes the restriction by using a transition-based search framework. |
| Outcome: | The proposed framework performs well with state-of-the-art models and is competitive without exhaustive searches. |
FC-KBQA: A Fine-to-Coarse Composition Framework for Knowledge Base Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for question answering over knowledge bases (KBQA) suffer from generalization issues due to coarse-grained modeling of the logical expression. |
| Approach: | They propose a fine-to- coarse-grained framework for KBQA to ensure generalization and executability of the logical expression. |
| Outcome: | The proposed framework derives new state-of-the-art performance on GrailQA and WebQSP, and runs 4 times faster than baseline. |
ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models (2024.findings-acl)
Copied to clipboard
Haoran Luo, Haihong E, Zichen Tang, Shiyao Peng, Yikai Guo, Wentai Zhang, Chenghao Ma, Guanting Dong, Meina Song, Wei Lin, Yifan Zhu, Anh Tuan Luu
| Challenge: | Existing KBQA methods address inefficient knowledge retrieval and semantic parsing errors. |
| Approach: | They propose a generatethen-retrieve KBQA framework that generates logical form and replaces entities and relations with an unsupervised retrieval method to improve both generation and retrieval more directly. |
| Outcome: | Experimental results show that ChatKBQA achieves new state-of-the-art performance on standard KBQA datasets, WebQSP, and CWQ. |
Pay More Attention to Relation Exploration for Knowledge Base Question Answering (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches focus on entity representation and final answer reasoning, which results in limited supervision for this task. |
| Approach: | They propose a framework that utilizes relations to enhance entity representation and introduce additional supervision. |
| Outcome: | The proposed framework improves the F1 score on two benchmark datasets by 5.8% . it improves by 6.7% on WebQSP, better than state-of-the-art methods . |
GRV-KBQA: A Three-Stage Framework for Knowledge Base Question Answering with Decoupled Logical Structure, Semantic Grounding and Structure-Aware Validation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Base Question Answering generate non-executable queries and inefficiencies in query execution. |
| Approach: | a framework that decouples logical structure generation from semantic grounding is proposed . the framework explicitly enforces KB constraints to improve alignment between generated logical forms and KB structures. |
| Outcome: | GRV-KBQA decouples logical structure generation from semantic grounding and incorporates structure-aware validation to enhance accuracy. |
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering (2026.findings-acl)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Jun Yang, Huipeng Ma, Chenhao Li, Luan Zhang, Yading Li, Xudong Li, Shenxi Liu, Jing Jiang
| Challenge: | Existing retrieval-augmented approaches focus on ignoring the structural information of the Knowledge Base (KB) and the question. |
| Approach: | They propose a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance. |
| Outcome: | Experiments on GrailQA, WebQSP, and GraphQuestions show that the proposed framework achieves state-of-the-art performance. |
Call Me When Necessary: LLMs can Efficiently and Faithfully Reason over Structured Environments (2024.findings-acl)
Copied to clipboard
Sitao Cheng, Ziyuan Zhuang, Yong Xu, Fangkai Yang, Chaoyun Zhang, Xiaoting Qin, Xiang Huang, Ling Chen, Qingwei Lin, Dongmei Zhang, Saravan Rajmohan, Qi Zhang
| Challenge: | Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables. |
| Approach: | They propose a framework that allows LLMs to efficiently and faithfully reason over structured environments. |
| Outcome: | The proposed framework surpasses state-of-the-art fine-tuned methods on three KGQA and two TableQA datasets and surpasse CWQ and WTQ methods. |
Large-Scale Relation Learning for Question Answering over Knowledge Bases with Pre-trained Language Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on the natural language but ignore textual information carried by the nodes and edges. |
| Approach: | They propose to perform relation extraction, relation matching, and relation reasoning tasks to align the natural language expressions to the relations in the KB and reason over the missing connections. |
| Outcome: | Experiments on WebQSP show that the proposed model outperforms baselines even when the KB is incomplete. |
Few-shot In-context Learning on Knowledge Base Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | KB-BINDER enables few-shot in-context learning over knowledge base questions . KBQA is a difficult problem due to the heterogeneity of knowledge bases . |
| Approach: | They propose a framework that enables few-shot in-context learning over KBQA tasks. |
| Outcome: | The proposed framework can outperform state-of-the-art models on GraphQA and MetaQA datasets. |
Graph Explorer: Training Faithful KG Agents with Visibility-Grounded Supervision (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) are strong reasoners but still hallucinate and make unreliable decisions on knowledge-intensive questions. |
| Approach: | They propose a pipeline that turns LLM into executable tool supervision without manual trace labeling. |
| Outcome: | The proposed model improves over a reproduced prompting baseline by +22.5/+16.2 points . it is based on a Graph Explorer pipeline that turns SPARQL into executable tool supervision without manual trace labeling. |
Query-Aware Graph Attention for Precise Subgraph Retrieval in Knowledge-Augmented Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing Knowledge Graph (KG)-based Retrieval-Augmented Generation (RAG) systems insufficiently model the interaction between query semantics and relation types, resulting in imprecise subgraph retrieval and unstable reasoning. |
| Approach: | They propose a retrieval framework that integrates query semantics and relation embeddings directly into the attention mechanism. |
| Outcome: | Experiments on WebQSP and CWQ establish new state-of-the-art results in both Triple Recall and Answer Recall. |
A Two-Stage Approach towards Generalization in Knowledge Base Question Answering (2022.findings-emnlp)
Copied to clipboard
Srinivas Ravishankar, Dung Thai, Ibrahim Abdelaziz, Nandana Mihindukulasooriya, Tahira Naseem, Pavan Kapanipathi, Gaetano Rossiello, Achille Fokoue
| Challenge: | Existing approaches for Knowledge Base Question Answering focus on a specific knowledge base or evaluating it on underlying knowledge base requires non-trivial changes. |
| Approach: | They propose a framework that separates semantic parsing from knowledge base interaction . they propose KBQA framework that allows generalization across knowledge bases . |
| Outcome: | The proposed framework achieves comparable or state-of-the-art performance on datasets with a different knowledge base. |
Improving Question Answering over Incomplete KBs with Knowledge-Aware Reader (P19-1)
Copied to clipboard
| Challenge: | Existing models that use incomplete knowledge bases and text data to answer open-domain questions are insufficient to cover full evidence. |
| Approach: | They propose a model which learns to aggregate answer evidence from incomplete knowledge bases and text snippets. |
| Outcome: | The proposed model improves on the widely-used KBQA benchmark WebQSP across settings with different extents of incompleteness. |
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 Ontology Graph: Toward Type-Constrained Knowledge Graph Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph question answering methods rely on LLM-induced type systems with inconsistent granularity or perform multi-hop reasoning without explicit target-type constraints. |
| Approach: | They propose a type-constrained knowledge graph question answering framework that reasons over a relation-centric ontology graph. |
| Outcome: | The proposed framework achieves state-of-the-art and produces ontology-grounded reasoning chains with substantial Hit@1 gains. |
Efficient One-Pass End-to-End Entity Linking for Questions (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for entity linking are limited to entity disambiguation and require mention boundaries to be given in the input. |
| Approach: | They propose a fast end-to-end entity linking model that uses a biencoder to jointly detect mentions and link in one pass. |
| Outcome: | The proposed model outperforms the current state of the art on WebQSP and GraphQuestions with extended annotations that cover multiple entities per question. |
A Sequential Flow Control Framework for Multi-hop Knowledge Base Question Answering (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for multi-hop reasoning in knowledge base question answering are coarse-grained and may bring information loss. |
| Approach: | They propose a sequential reasoning self-attention mechanism to capture the crucial reasoning information of each hop in a more fine-grained way. |
| Outcome: | The proposed model achieves new state-of-the-art Hits@1 of 76.8% on WebQSP and is also effective when KB is incomplete. |
KaeDe: Progressive Generation of Logical Forms via Knowledge-Aware Question Decomposition for Improved KBQA (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for answering natural language questions are difficult to generate . lack of a logical form for complex graphs can negatively impact overall performance . |
| Approach: | They propose a generate-then-retrieve method that converts questions into structured LF queries . they propose to combine knowledge-aware question decomposition and progressive LF generation . |
| Outcome: | The proposed method achieves state-of-the-art (SOTA) performance on WebQuestionSP and ComplexWebQuestions benchmarks. |
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. |
Ontology-Guided Reverse Thinking Makes Large Language Models Stronger on Knowledge Graph Question Answering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods rely on entity vector matching, but the purpose of the question is abstract and difficult to match with specific entities. Existing approaches rely only on entity-vector matching, and there is a problem with multi-hop reasoning. |
| Approach: | They propose a framework that constructs reasoning paths from purposes back to conditions using the KG ontology. |
| Outcome: | Experiments on the WebQSP and CWQ datasets show that ORT significantly improves the capability of large language models in knowledge graph question answering tasks (KGQA). |
GNN-RAG: Graph Neural Retrieval for Efficient Large Language Model Reasoning on Knowledge Graphs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to retrieval-augmented generation (RAG) rely on costly LLM calls to generate relation paths or traverse the KG. |
| Approach: | They propose a framework that uses lightweight Graph Neural Networks to enhance retrieval. |
| Outcome: | The proposed framework outperforms existing methods on multi-hop and multi-entity questions. |
SAFE: Schema-Driven Approximate Distance Join for Efficient Knowledge Graph Querying (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods map an LLM-generated query graph onto the KG or let the LLM traverse the entire graph. |
| Approach: | They propose a framework that leverages schema graphs for robust query graph generation and efficient KG retrieval. |
| Outcome: | Extensive experiments on WebQSP, CWQ and GrailQA show that the proposed framework outperforms state-of-the-art methods in accuracy and efficiency. |
Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs. |
| Approach: | They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction . |
| Outcome: | The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ. |
Less is More: Making Smaller Language Models Competent Subgraph Retrievers for Multi-hop KGQA (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies suggest that Knowledge Graphs (KGs) contain valuable external knowledge for LLMs. |
| Approach: | They propose to model a conditional subgraph retrieval task handled by small language models and use a subgraph identifier as a special token to retrieve subgraphs. |
| Outcome: | The proposed model achieves competitive retrieval performance compared to state-of-the-art models relying on 7B parameters. |
Interactive Semantic Parsing with Reinforcement Learning for Knowledge Graph Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to improve LLM reliability rely on factual hallucinations . Existing methods rely only on graph traversal, resulting in imprecise retrieval and heavy post-processing burdens. |
| Approach: | They propose a framework that integrates knowledge Graphs as structured, high-fidelity buffers to enhance LLM reliability. |
| Outcome: | The proposed framework allows logical constraints to be dynamically interleaved with graph search while optimizing via reinforcement learning with only final answer feedback eliminates the need for gold program annotations. |
Think Parallax: Solving Multi-Hop Problems via Multi-View Knowledge-Graph-Based Retrieval-Augmented Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing KG-RAG systems collapse all reasoning hops into a single representation, flat embedding space, suppressing this implicit structure and causing noisy or drifted path exploration. |
| Approach: | They propose a symmetric multi-view framework that decouples queries and KGs into aligned, head-specific retrieval spaces. |
| Outcome: | The proposed framework achieves state-of-the-art retrieval and QA performance on WebQSP and CWQ, and significantly reduces hallucination. |
Memory-augmented Query Reconstruction for LLM-based Knowledge Graph Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods that confuse tool utilization with knowledge reasoning harm readability and give rise to tool invocation hallucinations. |
| Approach: | They propose to decouple LLM from tool invocation tasks by establishing a memory module with explicit descriptions of query statements and a query memory module to facilitate the KGQA process. |
| Outcome: | The proposed method achieves state-of-the-art on WebQSP and CWQ benchmarks. |
COSMOS: Connectivity-Oriented Submodular Maximization for Optimal Subgraph Retrieval (2026.acl-long)
Copied to clipboard
| Challenge: | Existing paradigms treat facts independently or employ myopic search, failing to optimize collective subgraph utility. |
| Approach: | They propose a framework that formalizes evidence retrieval as a constrained submodular maximization problem. |
| Outcome: | The proposed framework captures the trade-off between information relevance and structural complexity. |
Execution as Verification: Fine-Grained Self-Correcting Reasoning for Complex KBQA (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge base question answering methods are limited by syntactic constraints and are prone to structural deviations that render queries unexecutable. |
| Approach: | They propose a framework that reframes semantic parsing as an iterative reasoning process driven by execution feedback. |
| Outcome: | The proposed method achieves significant improvements in query executability and answer accuracy on the WebQSP and CWQ datasets. |
D-RAG: Differentiable Retrieval-Augmented Generation for Knowledge Graph Question Answering (2025.emnlp-main)
Copied to clipboard
Guangze Gao, Zixuan Li, Chunfeng Yuan, Jiawei Li, Wu Jianzhuo, Yuehao Zhang, Xiaolong Jin, Bing Li, Weiming Hu
| Challenge: | Existing approaches to Knowledge Graph Question Answering (KGQA) use Retrieval-Augmented Generation (RAG) but subgraph selection process is non-differentiable, preventing end-to-end training of the retriever and the generator. |
| Approach: | They propose a Differentiable RAG approach that optimizes the retriever and the generator for KGQA. |
| Outcome: | The proposed approach outperforms state-of-the-art approaches on WebQSP and CWQ. |
Diagnosing and Remedying Representation Deficiencies for Deterministic Reasoning in KGQA (2026.acl-long)
Copied to clipboard
| 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. |