Conventional static knowledge graphs model entities in relational data as
nodes, connected by edges of specific relation types. However, information and
knowledge evolve continuously, and temporal dynamics emerge, which are expected
to influence future situations. In temporal knowledge graphs, time information
is integrated into the graph by equipping each edge with a timestamp or a time
range. Embedding-based methods have been introduced for link prediction on
temporal knowledge graphs, but they mostly lack explainability and
comprehensible reasoning chains. Particularly, they are usually not designed to
deal with link forecasting -- event prediction involving future timestamps. We
address the task of link forecasting on temporal knowledge graphs and introduce
TLogic, an explainable framework that is based on temporal logical rules
extracted via temporal random walks. We compare TLogic with state-of-the-art
baselines on three benchmark datasets and show better overall performance while
our method also provides explanations that preserve time consistency.
Furthermore, in contrast to most state-of-the-art embedding-based methods,
TLogic works well in the inductive setting where already learned rules are
transferred to related datasets with a common vocabulary.

TLogic 是一个可解释的框架，它基于通过时间随机游走提取的时间逻辑规则，用于处理时间知识图中的链接预测。与现有技术相比，在具有共同词汇表的相关数据集上，TLogic 能够更好地解释和推理，并提供更好的综合性能。