Answers are grounded in this paper and cite their sources.
Demonstrates higher accuracy in knowledge base question answering, suggesting improved answer reliability.
Knowledge base question answering (KBQA) aims to answer natural language questions by reasoning over large-scale structured knowledge bases (KBs). Among existing approaches, semantic parsing-based methods have emerged as a mainstream solution, where large language models (LLMs) are employed to translate questions into structured graph queries such as logical forms (LFs). However, this paradigm faces two critical challenges: (1) The complex semantic mapping and graph retrieval operations render direct one-shot LF generation difficult; (2) LLMs suffer from inherent hallucination issues, generating semantically plausible-seeming but factually incorrect or invalid LFs, which are non-executable. To address these challenges, this paper proposes HP-Corr , a novel framework that integrates H op-wise P lanning with iterative explainable self- Corr ection for faithful knowledge reasoning. Specifically, the system utilizes a fine-tuned open-source LLM for query planning and explainable self-correction. The query planner generates reasoning paths hop-by-hop, while an explainable self-correction provides hop-wise feedback, enabling interpretable path editing based on existing reasoning paths and retrieved KB knowledge. By introducing the dual-module cooperative architecture, our system performs iterative plan-then-correct to refine query paths progressively, ensuring answer reliability and LFs executability. Experimental results demonstrate significant improvements, with our approach achieving higher accuracy while substantially reducing the search space, particularly in complex multi-hop KBQA scenarios.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: