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.

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.
Question Answering Over Temporal Knowledge Graphs (2021.acl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (Temporal KGs) provide temporal scopes (start and end times) on each edge in the Knowledge . Lack of broad coverage datasets has been limiting progress in this area .
Approach: They propose a transformer-based solution that exploits recent advances in Temporal Knowledge Graph embeddings and achieves an increase of 120% in accuracy over the next best performing method.
Outcome: The proposed solution improves on the only known dataset by 340x . it increases accuracy by 120% over the baseline solution .
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.
Towards Multi-Relational Multi-Hop Reasoning over Dense Temporal Knowledge Graphs (2024.findings-acl)

Copied to clipboard

Challenge: Temporal knowledge graph reasoning is a crucial task for answering time-dependent questions within a knowledge graph (KG).
Approach: They propose a temporal KG reasoning benchmark with over 200k entities and 960k questions that facilitate complex, multi-relational and multi-hop reasoning.
Outcome: The proposed model is able to conduct pattern-aware and time-sensitive reasoning across temporal KGs and is scalable to a wide range of data conditions.
Multi-granularity Temporal Question Answering over Knowledge Graphs (2023.acl-long)

Copied to clipboard

Challenge: Existing work on temporal knowledge graphs ignores fact that real-life applications of TKGQA are complex in temporal granularity.
Approach: They propose a large scale dataset for multi-granularity temporal question answering over knowledge graphs . they propose comparing MultiQA over MultiTQ to better reflect real-world challenges .
Outcome: The proposed dataset is among the first of its kind and features multiple temporal granularities.
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.
TimeR4 : Time-aware Retrieval-Augmented Large Language Models for Temporal Knowledge Graph Question Answering (2024.emnlp-main)

Copied to clipboard

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.
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.
TECHS: Temporal Logical Graph Networks for Explainable Extrapolation Reasoning (2023.acl-long)

Copied to clipboard

Challenge: Existing frameworks for extrapolating knowledge graphs are incomplete and do not represent real-world knowledge.
Approach: They propose an explainable extrapolation reasoning framework that integrates propositional reasoning and first-order reasoning by introducing a reasoning graph that iteratively expands to find the answer.
Outcome: The proposed framework outperforms state-of-the-art baselines in explaining future facts based on past counterparts.
Improving Time Sensitivity for Question Answering over Temporal Knowledge Graphs (2022.acl-long)

Copied to clipboard

Challenge: Temporal knowledge graphs record entity relations and when they occur in time . previous work fails to address time-related challenges such as time-order issues . paper proposes time-sensitive question answering framework to address these problems .
Approach: They propose a time-sensitive question answering framework that uses temporal KGs to answer natural language questions.
Outcome: The proposed framework outperforms the state-of-the-art on a new benchmark for question answering over temporal knowledge graphs.

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