From Parse-Execute to Parse-Execute-Refine: Improving Semantic Parser for Complex Question Answering over Knowledge Base (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for parsing knowledge-base questions into executable logical forms have not been successful on complex KBQA. |
| Approach: | They propose a new semantic parser called KoPL to model the reasoning processes . they propose 'parse-execute-refine' paradigm to unlock reasoning ability . |
| Outcome: | The proposed parser performs better than the state-of-the-art on complex KBQA . the proposed parsed-execute-refine paradigm can model complex reasoning steps . |
Similar Papers
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. |
Generating then Refining for Reliable Knowledge Base Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge base question answering methods generate LFs that are non-executable due to semantic hallucination issue of large language models. |
| Approach: | They propose a "generate-verify-refine" framework for reliable LF generation . they propose ARI-KBQA to generate query paths based on hop-by-hop reasoning . |
| Outcome: | The proposed framework significantly improves model performance with a reduced search space . ARI-KBQA can generate LFs that are non-executable due to semantic hallucination issue . |
Rule-KBQA: Rule-Guided Reasoning for Complex Knowledge Base Question Answering with Large Language Models (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge base question answering lack grammaticality, faithfulness, and controllability due to hallucinations in the reasoning process. |
| Approach: | They propose a framework that employs learned rules to guide the generation of logical forms. |
| Outcome: | The proposed method achieves competitive results on standard KBQA datasets. |
Towards Transparent Interactive Semantic Parsing via Step-by-Step Correction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on semantic parsing focus on mapping a natural-language utterance to a logical form (LF) but natural language may contain ambiguity and variability, making this challenge difficult. |
| Approach: | They propose an interactive semantic parsing framework that explains the predicted LF step by step in natural language and enables the user to make corrections through natural-language feedback for individual steps. |
| Outcome: | The proposed framework improves parsing accuracy and transparency in a crowdsourced dialogue dataset. |
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. |
Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Knowledge base question answering (KBQA) is a challenging task, particularly in parsing intricate questions into executable logical forms. |
| Approach: | They propose a framework to generate logical forms through direct interaction with knowledge bases (KBs) by annotating a dataset with step-wise reasoning processes. |
| Outcome: | The proposed framework achieves competitive results on the WebQuestionsSP, ComplexWebQuestIONS, KQA Pro, and MetaQA datasets with a minimal number of examples (shots). Importantly, the proposed model supports manual intervention, allowing for the iterative refinement of LLM outputs. |
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. |
KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base (2022.acl-long)
Copied to clipboard
Shulin Cao, Jiaxin Shi, Liangming Pan, Lunyiu Nie, Yutong Xiang, Lei Hou, Juanzi Li, Bin He, Hanwang Zhang
| Challenge: | Existing benchmarks for Complex KBQA lack compositional reasoning capabilities . Existing methods for Complex questions are poor in diversity or scale . |
| Approach: | They propose a compositional programming language to represent the reasoning process of complex questions. |
| Outcome: | The proposed dataset includes around 120K diverse natural language questions . it provides a compositional and interpretable programming language to represent the reasoning process of complex questions based on the proposed model . |
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. |
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. |