arXiv:2605. 07121v2 Announce Type: replace Abstract: Temporal knowledge graphs (TKGs) represent time-stamped relational facts and support a wide range of reasoning tasks over evolving events.
arXiv:2609.36559v1 Announce Type: cross Abstract: Extrapolative temporal knowledge graph reasoning (TKGR) predicts future facts from historical snapshots. Most existing methods train once on an early...
arXiv:2608. 20083v1 Announce Type: cross Abstract: Question Answering over Temporal Knowledge Graphs (TKGQA) requires reasoning over time-sensitive facts, yet existing embedding-based methods struggle with multi-step queries due to single-pass reasoning pipelines.
arXiv:2605.30152v2 Announce Type: replace-cross Abstract: Proactive assistants continuously decide when to intervene and what context should support the intervention. Large language model (LLM) pipel...
Question Answering over Temporal Knowledge Graphs (TKGQA) requires reasoning over time-sensitive facts, yet existing embedding-based methods struggle with multi-step queries due to single-pass reasoning pipelines. We propose SABET-QA, a framework that iteratively refines reasoning states across multiple hops via a bidirectional entity-temporal scoring mechanism and a slot-aware contextualization module that aligns question semantics with temporal KG embeddings.
arXiv:2606. 27651v1 Announce Type: new Abstract: In recent years, with the emergence of Temporal Knowledge Graphs (TKGs), research on learning entity and relation representations in TKGs has attracted increasing attention, giving rise to a large number of TKG embedding methods.
arXiv:2607. 14886v1 Announce Type: new Abstract: Temporal Knowledge Graph (TKG) reasoning under the extrapolation setting focuses on forecasting future time-stamped events (facts) from historical data in a temporal knowledge graph.
The paper introduces RoMem, a temporal knowledge graph module that treats time as continuous phase rotation rather than discrete labels. RoMem uses a Semantic Speed Gate to assign volatility scores to relations, allowing evolving facts to rotate quickly while persistent facts remain stable, thereby preventing the need for deletion or costly LLM calls. The method achieves state‑of‑the‑art performance on ICEWS05‑15 and improves temporal reasoning in agentic memory benchmarks such as MultiTQ, LoCoMo, and FinTMMBench.
arXiv:2607. 10197v1 Announce Type: new Abstract: Knowledge graph foundation models such as Ultra and Trix achieve strong inductive transfer by learning relation-graph representations that generalise to unseen entities and relations.
arXiv:2607. 25554v1 Announce Type: new Abstract: Future event prediction carries broad social impact yet remains challenging.
arXiv:2606. 15778v1 Announce Type: cross Abstract: Large Language Models (LLMs) struggle to incorporate new knowledge without forgetting or costly retraining.
arXiv:2605. 29640v3 Announce Type: replace Abstract: Large Language Models have revolutionized interactive applications; however, their finite context windows pose a critical data management challenge for maintaining stateful, long-term interactions.
arXiv:2607. 18368v1 Announce Type: new Abstract: Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time.