Challenge: Temporal Knowledge Graph Question Answering (TKGQA) aims to answer temporal questions using knowledge in Temporal knowledge graphs (TKTs).
Approach: They propose a Time-aware retrieve-rewrite-retrieve-rerank framework to integrate temporal knowledge from TKGs into Large Language Models (LLMs) to reduce temporal hallucination, they propose rewrite module to rew questions using background knowledge stored in TKG's, then implement a retrieve-rank module to retrieve semantically and temporally relevant facts from Tkgs and rerank them according to temporal constraints.
Outcome: The proposed approach achieves relative gains of 47.8% and 22.5% on two datasets, underscoring its effectiveness in boosting the temporal reasoning abilities of LLMs.

Similar Papers

Temporal Evidence Chain for Temporal Knowledge Graph Question Answering with Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graph Question Answering (TKGQA) aims to answer temporal questions using knowledge from Temporal knowledge graphs.
Approach: They propose a framework to construct temporal evidence chains for LLM reasoning using Temporal Knowledge Graphs.
Outcome: TECQA outperforms existing methods on MultiTQ and CronQuestions.
RTQA : Recursive Thinking for Complex Temporal Knowledge Graph Question Answering with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Current temporal knowledge graph question answering methods focus on implicit temporal constraints and lack the capability to handle complex temporal queries.
Approach: They propose a temporal knowledge graph question answering framework that recursively decomposes questions into sub-problems and employs multi-path answer aggregation to improve fault tolerance.
Outcome: The proposed framework outperforms existing methods on multiTQ and TimelineKGQA benchmarks.
Two-stage Generative Question Answering on Temporal Knowledge Graph Using Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Temporal knowledge graph question answering (TKGQA) is one of the most challenging QA tasks due to the temporal constraints hidden in questions and the answers sought from dynamic structured knowledge.
Approach: They propose a generative temporal knowledge graph question answering framework which guides LLMs to answer temporal questions through two phases: Subgraph Retrieval and Answer Generation.
Outcome: The proposed framework exploits LLM’s intrinsic knowledge to mine temporal constraints and structural links in the questions without extra training, thus narrowing down the subgraph search space in both temporal and structural dimensions.
Time-aware ReAct Agent for Temporal Knowledge Graph Question Answering (2025.findings-naacl)

Copied to clipboard

Challenge: Existing solutions for temporal knowledge graph question answering lack sufficient temporal constraints in retrieval process.
Approach: They propose a temporal knowledge graph question answering framework that integrates temporal constraints into information retrieval.
Outcome: The proposed framework achieves a 41.3% improvement over the baseline model and a 32.2% gain compared to the Abstract Reasoning Induction (ARI) method.
Self-Improvement Programming for Temporal Knowledge Graph Question Answering (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods implicitly model time constraints by learning time-aware embeddings of questions and candidate answers, which is far from understanding the question comprehensively.
Approach: They propose a temporal-based temporal programming method that leverages the in-context learning ability of Large Language Models to understand combinatory time constraints in questions.
Outcome: The proposed method outperforms existing methods on multiTQ and CronQuestions datasets and is highly efficient on multi-level questions.
GenTKG: Generative Forecasting on Temporal Knowledge Graph with Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods for temporal relational forecasting are limited and require limited training data.
Approach: They propose a retrieval-augmented generation framework that uses temporal logical rule-based retrieval and parameter-efficient instruction tuning to solve temporal knowledge forecasting challenges.
Outcome: The proposed framework outperforms conventional methods in the temporal knowledge graph domain with low computation resources.
MusTQ: A Temporal Knowledge Graph Question Answering Dataset for Multi-Step Temporal Reasoning (2024.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on fact-centered reasoning with limited attention to temporal reasoning.
Approach: They propose a new TKGQA dataset, MusTQ, which contains 666K multi-step temporal reasoning questions and a TKG.
Outcome: The proposed model achieves state-of-the-art multi-step temporal reasoning ability with entity-time attention mechanism and optimized temporal knowledge graph representation.
TempTool-R1: Tool-Augmented Reinforcement Learning for Temporal Knowledge Graph Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to temporal knowledge graph question answering struggle with multi-hop reasoning and implicit temporal constraints.
Approach: They propose a temporal tool-based API capable of transforming implicit temporal cues into executable operations and supervised fine-tuning teaches the model to interweave chain-of-thought reasoning with think-then-tool usage.
Outcome: The proposed framework outperforms existing methods on three challenging questions.
TwiRGCN: Temporally Weighted Graph Convolution for Question Answering over Temporal Knowledge Graphs (2023.eacl-main)

Copied to clipboard

Challenge: Recent years have witnessed interest in Temporal Question Answering over Knowledge Graphs (TKGQA) but these methods are highly engineered and do not automatically discover relevant parts of the KG during multi-hop reasoning.
Approach: They propose a scheme to modulate the messages passed through a KG edge during convolution based on the relevance of its associated period to the question.
Outcome: The proposed system outperforms state-of-the-art models on a recent challenging dataset for multi-hop complex temporal QA called TimeQuestions.
SiMFy: A Simple Yet Effective Approach for Temporal Knowledge Graph Reasoning (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability.
Approach: They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference.
Outcome: The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability.

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