Regret-Now: A Physics-Inspired Regret Framework for Temporal Knowledge Graph Question Answering with LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models have impressive results in general reasoning tasks, but they still exhibit a lack of dynamic error-correction. |
| Approach: | They propose a temporal reasoning framework that uses the principle of minimum potential energy to model the reasoning process as a dynamic trajectory moving toward a more stable state. |
| Outcome: | The proposed framework shows consistent gains over strong baselines on two standard TKGQA benchmarks. |
Similar Papers
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. |
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. |
Temporal Extrapolation and Knowledge Transfer for Lifelong Temporal Knowledge Graph Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for lifelong TKG reasoning only address part of the challenges. |
| Approach: | They propose a temporal-path-based reinforcement learning framework for lifelong TKG reasoning . they add temporal displacement into the action space of RL to extrapolate for the future . |
| Outcome: | The proposed model outperforms existing models against well-adapted baselines on three lifelong TKG reasoning benchmarks. |
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. |
Learning to Reason Over Time: Timeline Self-Reflection for Improved Temporal Reasoning in Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Large Language Models struggle with temporal reasoning, which requires processing time-related information such as event sequencing, durations, and inter-temporal relationships. |
| Approach: | They propose a framework that enhances the temporal reasoning abilities of Large Language Models (LLMs) by combining timeline construction with iterative self-reflection. |
| Outcome: | The proposed framework improves the temporal reasoning abilities of large language models and improves traceability of the inference process. |
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. |
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. |
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. |
Temporal Knowledge Question Answering via Abstract Reasoning Induction (2024.acl-long)
Copied to clipboard
| Challenge: | a new method to enhance temporal knowledge reasoning in large language models addresses this challenge . Abstract Reasoning Induction (ARI) framework provides factual knowledge support to LLMs . |
| Approach: | They propose an abstract reasoning induction framework which divides temporal reasoning into two phases: Knowledge agnostic and Knowledge-based. |
| Outcome: | The proposed method achieves significant gains on two temporal QA datasets. |
Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs (2021.acl-long)
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are used in many different areas of research. |
| Approach: | They propose to use a beam search policy to induce multiple clues from historical facts . they propose to adopt a graph convolution network based sequence method to deduce answers from clues . |
| Outcome: | The proposed model can predict future facts in two stages, Clue Searching and Temporal Reasoning. |