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 .

Similar Papers

Temporal Knowledge Graph Reasoning with Dynamic Hypergraph Embedding (2024.lrec-main)

Copied to clipboard

Challenge: Existing models that model temporal dynamics with knowledge graphs and graph convolution networks lack high-order interactions between objects in TKG, which is an important factor to predict future facts.
Approach: They propose to embed temporal knowledge graph reasoning by constructing hypergraphs based on temporal information graphs at different timestamps and then adapt dynamic meta-embedding to fit TKG.
Outcome: The proposed method outperforms baseline models on public TKG datasets and provides good interpretation for the predicted results.
HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning (2022.findings-emnlp)

Copied to clipboard

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.
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.
Temporal Knowledge Graph Reasoning Based on N-tuple Modeling (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing Temporal Knowledge Graphs (TKGs) only contain their core entities and form them as quadruples.
Approach: They propose to describe a temporal fact more accurately as an n-tuple . they propose to use a neural network to learn evolutional representations of entities .
Outcome: The proposed model oversimplifies and causes information loss on two 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.
HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding (D18-1)

Copied to clipboard

Challenge: Existing KG embedding methods ignore this temporal dimension while learning embedds of the KG elements.
Approach: They propose a temporally aware KG embedding method which incorporates time in the entity-relation space by associating each timestamp with a corresponding hyperplane.
Outcome: The proposed method performs KG inference using temporal guidance and predicts scopes for relational facts with missing time annotations.
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.
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.
Relation Logical Reasoning and Relation-aware Entity Encoding for Temporal Knowledge Graph Reasoning (2025.coling-main)

Copied to clipboard

Challenge: Current knowledge graph models focus on embedding entities and relations, overlooking the broader structure of the entire knowledge graph.
Approach: They propose a Temporal Knowledge Graph Reasoning model that embeds relation embeddings into the TKG.
Outcome: The proposed model outperforms state-of-the-art models on five public datasets . it uses relation-aware attention mechanisms to learn relation embeddings based on query relations .
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.

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