We address the task of temporal knowledge graph forecasting with an inherently interpretable method based on symbolic rules. Motivated by recent work proposing a strong baseline based on recurrent facts, our approach learns four simple rule types, including temporal rules with confidence functions that combine both recency and frequency. Evaluated on nine datasets, our method achieves performance that is competitive with state-of-the-art models and outperforms the majority of them, while each prediction remains directly traceable to the rules and observations that produced it. Moreover, our approach remains functional on very large datasets, where other methods encounter runtime or memory failures.
CountTRuCoLa: Rule Learning for Interpretable Temporal Knowledge Graph Forecasting
We address the task of temporal knowledge graph forecasting with an inherently interpretable method based on symbolic rules. Motivated by recent work proposing a strong baseline based on recurrent facts, our approach learns four simple rule types, including temporal rules with…
- Preview

- Year
- 2025
- Hosting
- Full text hostedCC-BY-4.0
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2509.09474CC-BY-4.0
- TL;DR
- Semantic Scholar