Challenge: Temporal Knowledge Graphs (TKGs) store facts as triples in the form of subject, relation, object, timestamps.
Approach: They propose a Temporal Knowledge Graph (TKG) model that extends each triple with a timestamp to describe dynamic facts.
Outcome: The proposed model improves on six benchmark datasets with up to 5.6% performance improvement compared to the state-of-the-art models.

Similar Papers

Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing models of temporal fact reasoning do not explicitly specify temporal information for each fact.
Approach: They propose a new type of data structure called hyper-relational TKG to study temporal fact reasoning over HKGs.
Outcome: The proposed model is based on two new benchmark HTKG datasets . it provides additional key-value pairs (i.e., qualifiers) for each KG fact .
Multi-Granularity History and Entity Similarity Learning for Temporal Knowledge Graph Reasoning (2024.emnlp-main)

Copied to clipboard

Challenge: Existing models for Temporal Knowledge Graph reasoning capture repetitive history, ignoring the entity's multi-hop neighbour history which can provide valuable background knowledge for TKG reasoning.
Approach: They propose a multi-granularity history and entity similarity learning model which captures the similarity between entities.
Outcome: The proposed model can predict unknown facts based on historical information, but most existing models ignore multi-hop neighbour history which can provide valuable background knowledge for TKG reasoning.
MetaTKG: Learning Evolutionary Meta-Knowledge for Temporal Knowledge Graph Reasoning (2022.emnlp-main)

Copied to clipboard

Challenge: Existing models rely on historical information to learn embeddings for entities, but ignore the evolution of facts.
Approach: They propose a Temporal Meta-learning framework to learn evolutionary meta-knowledge from TKGs.
Outcome: The proposed method improves on four widely-used datasets and three backbones on a wide range of scenarios on tKGs.
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.
Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting (2024.findings-acl)

Copied to clipboard

Challenge: Existing graph-based models excel at capturing structural information within TKGs but lack semantic comprehension abilities.
Approach: They propose a plug-and-play module to enhance the performance of graph-based TKG models by exploring high-order histories step-by-step.
Outcome: Experiments on three datasets and backbones show that CoH is effective in capturing high-order historical information for LLMs.
DLTKG: Denoising Logic-based Temporal Knowledge Graph Reasoning (2025.findings-emnlp)

Copied to clipboard

Challenge: Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes.
Approach: They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability .
Outcome: The proposed framework outperforms state-of-the-art methods on three benchmark datasets.
Learning Latent Relations for Temporal Knowledge Graph Reasoning (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for Temporal Knowledge Graph reasoning capture intra- and inter-time latent relations between entities that appear at different times.
Approach: They propose a Latent relations Learning method for TKG reasoning that captures latent relations between entities at different times.
Outcome: The proposed method exploits the intra- and inter-time latent relations of entities at different times.
Graph Hawkes Transformer for Extrapolated Reasoning on Temporal Knowledge Graphs (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods for entity prediction cannot predict when an event will occur . there are many facts not related to the query that can confuse the model .
Approach: They propose a temporal knowledge Graph reasoning model based on Graph Hawkes Transformer . the model captures instantaneous structural and temporal evolution information .
Outcome: The proposed model performs much better under long-term evolution scenarios.
RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion (2026.eacl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (TKGs) represent dynamic facts as timestamped relations between entities. Large Language Models (LLMs) have sparked interest in using pretrained generative models for TKG completion.
Approach: They propose a framework that allows for rule-based multi-hop sampling and contrastive fine-tuning to shape relational compatibility.
Outcome: Experiments show that RECIPE-TKG outperforms prior LLM-based methods across input regimes.
TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods focus on reasoning at past timestamps to complete the missing facts, and there are only a few works of reasoning on known TKGs to forecast future facts.
Approach: They propose a time-shaped reward method that captures historical knowledge graph snapshots and a new representation method for unseen entities to improve the inductive inference ability of the model.
Outcome: The proposed method improves on four benchmark datasets with higher explainability, less calculation, and fewer parameters when compared with existing state-of-the-art methods.

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