Shenxi Liu
2026
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering
Yuhang Tian | Dandan Song | Zhijing Wu | Changzhi Zhou | Jun Yang | Huipeng Ma | Chenhao Li | Luan Zhang | Yading Li | Xudong Li | Shenxi Liu | Jing Jiang
Findings of the Association for Computational Linguistics: ACL 2026
Yuhang Tian | Dandan Song | Zhijing Wu | Changzhi Zhou | Jun Yang | Huipeng Ma | Chenhao Li | Luan Zhang | Yading Li | Xudong Li | Shenxi Liu | Jing Jiang
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) have shown great potential in Knowledge Base Question Answering (KBQA) via semantic parsing. However, existing retrieval-augmented approaches typically retrieve entities and relations in isolation based solely on semantic similarity, ignoring the structural information of the Knowledge Base (KB) and the question. To address this limitation, we propose SELF-KBQA (Subgraph-Guided Executable Logical Form Generation), a novel framework that empowers LLMs to generate logical forms conditioned on structurally aligned and semantically relevant subgraphs. Specifically, we introduce a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance. Subsequently, we employ a token-budgeted evidence condensation strategy to distill the top-ranked subgraphs into compact contexts for the generation stage. Extensive experiments on GrailQA, WebQSP, and GraphQuestions demonstrate that SELF-KBQA achieves state-of-the-art performance.