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与三个基准数据集的最新基线进行比较,并显示更好的总体性能,同时我们的方法也提供了保持时间一致性的解释。此外,与大多数最先进的基于嵌入方法相比,TLogic在绘图中做了很好的工作,因为在那里已经学到的规则被转移到了与共同词汇有关的数据集。