Pith. sign in

REVIEW 2 cited by

Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.00327 v1 pith:RXAO53NV submitted 2021-06-01 cs.AI

classification cs.AI
keywords cluesclusterfuturereasoningtemporalfactssearchclue
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Temporal Knowledge Graphs (TKGs) have been developed and used in many different areas. Reasoning on TKGs that predicts potential facts (events) in the future brings great challenges to existing models. When facing a prediction task, human beings usually search useful historical information (i.e., clues) in their memories and then reason for future meticulously. Inspired by this mechanism, we propose CluSTeR to predict future facts in a two-stage manner, Clue Searching and Temporal Reasoning, accordingly. Specifically, at the clue searching stage, CluSTeR learns a beam search policy via reinforcement learning (RL) to induce multiple clues from historical facts. At the temporal reasoning stage, it adopts a graph convolution network based sequence method to deduce answers from clues. Experiments on four datasets demonstrate the substantial advantages of CluSTeR compared with the state-of-the-art methods. Moreover, the clues found by CluSTeR further provide interpretability for the results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mixture Policy based Multi-Hop Reasoning over N-tuple Temporal Knowledge Graphs

    cs.AI 2025-05 conditional novelty 6.0 of 10

    MT-Path predicts missing entities in N-tuple temporal knowledge graphs by training a mixture of three reinforcement-learning path-finding policies (predicate, core-element, whole-fact) with an auxiliary-aware GCN, and...

  2. VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs

    cs.AI 2025-05 conditional novelty 5.0 of 10

    VITA uses a (conjunction, start, end) time triplet and an encoder-decoder Transformer to predict missing entities, relations, times, and numeric literals in temporal hyper-relational knowledge graphs, outperforming ba...

Pith tools