LiFTER turns future-link forecasting into a verifiable grounded computation and achieves competitive historical-negative forecasting and the highest macro explanation ac- curacy and deletion fidelity across four CTDG benchmarks.
Abstract
Continuous-time dynamic graph models predict future links by compressing past interactions into neural states. Although effective for forecasting, this computation obscures which entities are shared across events and how temporal patterns contribute to a prediction. We treat this gap as a property of the predictive architecture rather than a problem to be addressed after prediction. Link-Fact Temporal Rule Inducer (LiFTER) is a neuro-symbolic predictor that preserves observed interactions as grounded temporal facts and applies executable tempo- ral rules to pre-query facts. Each score is a signed sum of rule exe- cutions whose historical facts, entity bindings, and temporal order are explicitly satisfied. The evidence and rules responsible for a prediction can therefore be inspected, independently recomputed, and intervened upon. Across four CTDG benchmarks, LiFTER achieves competitive historical-negative forecasting and the highest macro explanation ac- curacy and deletion fidelity. The same architecture also serves as a microscope that separates the contributions of recurrence, history po- sition, and transition across datasets and traces them to individual facts. Independent execution reconstructs all logits for 19,664 test predictions with a maximum error of 0.0000131. LiFTER turns future-link forecasting into a verifiable grounded computation.
In controlled synthetic settings, semantically grounded trajectories provide an effective representation for temporal structural reasoning, supporting further investigation of semantic interfaces between event data, structured representations, and temporal learning.
Michael Romei De Socio, G. Pozzato, Alessio Merlo· arXiv.org· 0 citations
Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic. Our setting uses temporal knowledge-graph memory in RoomKG...
Taewoon Kim, Vincent François-Lavet, Michael Cochez· 0 citations
This work formalizes explanations as Halpern-Pearl actual causes, modeling input dependencies using Boolean Structural Causal Models (SCMs), and compute HP causes by applying bound propagation and branch-and-bound techniques, while providing formal guarantees of completeness and minimality.
J. Strobel, Muqsit Azeem, Stefan Leue· 0 citations
GAttNHP improves over state-of-the-art baselines on both entity prediction and time prediction, and ablations confirm that its largest gains arise on the long-tail event chains where existing models fail most severely.
Xiangni Tian, Kaixian Yu, Runpeng Dai et al.· arXiv.org· 0 citations
The Temporal-Weighted Transfer Network (TWTNET), a novel reasoning model that jointly leverages statistical modeling and historical information transfer, is proposed, which achieves more robust and interpretable extrapolative reasoning.
Hongyu Hao, Yifan Zhang, Xinru Zhao et al.· ACM Transactions on Intellig...· 0 citations
Interpreting predictions of temporal graph neural networks (TGNNs) is challenging: structural patterns are entangled with temporal dynamics and node-level activity. Existing methods often overemphasize frequent or recent interactions, producing explanations that conflate structural influence with temporal or behavioral...
Mingjian Lu, Hieu M. Vu, Vu K Le et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.