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.

Similar Papers

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).
From Query to Logic: Ontology-Driven Multi-Hop Reasoning in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) exhibit limitations in complex multi-hop question answering tasks that necessitate non-linear, structured reasoning.
Approach: They propose an ontology-driven reasoning and chain framework that combines LLMs’ generative capabilities with the structural benefits of knowledge graphs.
Outcome: Extensive experiments across a diverse set of models and standard MQA benchmarks demonstrate that the proposed framework achieves competitive performance while producing more interpretable reasoning chains.
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.
Constraint-based Multi-hop Question Answering with Knowledge Graph (2022.naacl-industry)

Copied to clipboard

Challenge: Recent work addresses multi-hop KGQA, which requires reasoning across numerous edges of the KG.
Approach: They propose to use KG embeddings to reduce KG sparsity by performing missing link prediction.
Outcome: Empirical results show that the proposed method produces state-of-the-art results on three KGQA datasets.
Right for Right Reasons: Large Language Models for Verifiable Commonsense Knowledge Graph Question Answering (2024.emnlp-main)

Copied to clipboard

Challenge: Existing Knowledge Graph Question Answering (KGQA) methods focus on answering factual questions, leaving questions involving commonsense reasoning unaddressed.
Approach: They propose a commonsense KGQA methodology that axiomatically surfaces commonsensical knowledge of Large Language Models and grounding every factual reasoning step on KG triples.
Outcome: The proposed method outperforms existing methods and reduces instances of hallucination and reasoning errors.
BYOKG-RAG: Multi-Strategy Graph Retrieval for Knowledge Graph Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to knowledge graph question answering (KGQA) rely on Large Language Model (LLM) agents for graph traversal and retrieval.
Approach: They propose a framework that synergizes Large Language Models with specialized graph retrieval tools to enhance KGQA.
Outcome: The proposed framework outperforms the second-best graph retrieval method by 4.5% points while showing better generalization to custom KGs.
Chain-of-Relations: Faithful and Efficient LLM Reasoning over Knowledge Graphs via Relation-Centric Exploration (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods adopt entity-centric exploration that incrementally constructs reasoning paths by selecting and connecting intermediate entities.
Approach: They propose to use relation-centric exploration to construct reasoning paths by selecting and connecting intermediate entities and to reduce the dependence on entity completeness.
Outcome: The proposed method outperforms baselines on three benchmark datasets in both F1 score and KG-grounded Rate.
Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods employ resource-intensive, non-scalable workflows reasoning on vanilla KGs, but overlook this gap.
Approach: They propose a flexible framework that leverages LLMs’ prior knowledge to enrich KGs and bridge the semantic gap between queries and graphs.
Outcome: The proposed framework bridges the semantic gap between structured knowledge graphs and unstructured queries while ensuring low computational costs, scalability, and adaptability across different methods.
Wikontic: Constructing Wikidata-Aligned, Ontology-Aware Knowledge Graphs with Large Language Models (2026.eacl-long)

Copied to clipboard

Challenge: Knowledge graphs provide structured, verifiable grounding for large language models . current LLMs use KGs as auxiliary structures for text retrieval .
Approach: They propose a pipeline that constructs KGs from open-domain texts using triplets and qualifiers.
Outcome: The proposed pipeline outperforms existing methods in retrieval-augmented generation.
ReaRev: Adaptive Reasoning for Question Answering over Knowledge Graphs (2022.findings-emnlp)

Copied to clipboard

Challenge: Knowledge Graph Question Answering (KGQA) involves retrieving entities as answers from a Knowledge Flow using natural language queries.
Approach: They propose a method to decode a question into instructions that are dense question representations used to guide the KG traversals.
Outcome: The proposed method improves instruction decoding and execution by using a KG-aware information to update the initial instructions.

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