Challenge: KG-MulQA extracts QA pairs at multiple complexity levels along three key dimensions: multi-hop retrieval, set operations, and answer plurality.
Approach: They propose a framework that extracts QA pairs at multiple complexity levels along three key dimensions: multi-hop retrieval, set operations, and answer plurality.
Outcome: The framework extracts QA pairs at multiple complexity levels along key dimensions . it enables fine-grained assessment of model performance across controlled difficulty levels.

Similar Papers

Beyond the Answer: Advancing Multi-Hop QA with Fine-Grained Graph Reasoning and Evaluation (2025.acl-long)

Copied to clipboard

Challenge: Existing evaluations of multi-hop question answering systems focus on comparing final answers of reasoning method and given ground-truths.
Approach: They propose a "Planner-Executor-Reasoner" architecture that evaluates reasoning . they propose PER-DP and PER QA architectures that provide ground-truths .
Outcome: The proposed model improves the performance of multi-hop question answering systems.
SocraticKG: Knowledge Graph Construction via QA-Driven Fact Extraction (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to construct knowledge graphs struggle with factual coverage and information loss.
Approach: They propose an automated KG construction method that introduces question-answer pairs as a structured intermediate representation to unfold document-level semantics prior to triple extraction.
Outcome: The proposed method achieves superior factual retention while maintaining high structural cohesion even as extracted knowledge volume substantially expands.
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.
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning.
Approach: They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning.
Outcome: Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines.
Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable performance on question-answering tasks due to their superior capabilities in natural language understanding and generation.
Approach: They propose a structured taxonomy that categorizes the methodology of synthesizing LLMs and knowledge graphs for QA according to the categories of QA and the KG’s role when integrating with LLM.
Outcome: The proposed taxonomy categorizes the methods according to the categories of QA and the KG’s role when integrating with LLMs.
QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering (2021.naacl-main)

Copied to clipboard

Challenge: Existing question answering systems lack the ability to access relevant knowledge and reason over it.
Approach: They propose a model that uses KGs to identify relevant knowledge in QA contexts and perform joint reasoning over them.
Outcome: The proposed model improves on the CommonsenseQA and OpenBookQA datasets and performs interpretable and structured reasoning.
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.
Search-in-Context: Efficient Multi-Hop QA over Long Contexts via Monte Carlo Tree Search with Dynamic KV Retrieval (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to multihop question answering (MHQA) over long contexts are often neglecting explicit reasoning or incurring expensive computational costs due to full-attention mechanisms over long contextuals.
Approach: They propose a framework that integrates Monte Carlo Tree Search (MCTS) with dynamic key-value retrieval to enable iterative, context-aware reasoning.
Outcome: The proposed framework integrates Monte Carlo Tree Search (MCTS) with dynamic key-value (KV) retrieval to enable iterative, context-aware reasoning.
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context.
Approach: They propose to use a knowledge graph to extract query-relevant information from unstructured text.
Outcome: The proposed method achieves performance improvements on two popular datasets.
KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base (2022.acl-long)

Copied to clipboard

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 .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations