Theoretical Knowledge Graph Reasoning via Ending Anchored Rules

11/12/2020 ∙ by Canlin Zhang, et al. ∙ 0

Discovering precise and specific rules from knowledge graphs is regarded as an essential challenge, which can improve the performances of many downstream tasks and even provide new ways to approach some Natural Language Processing research topics. In this paper, we provide a fundamental theory for knowledge graph reasoning based on ending anchored rules. Our theory provides precise reasons answering why or why not a triple is correct. Then, we implement our theory by what we called the EARDict model. Results show that the EARDict model achieves new state-of-the-art performances on benchmark knowledge graph completion tasks, including a Hits@10 score of 80.38 percent on WN18RR.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.