,
Zhe Wang
,
Kewen Wang
,
Pouya Ghiasnezhad Omran
,
Jiangmeng Li
Creative Commons Attribution 4.0 International license
Compared to black-box neural networks, logic rules express explicit knowledge, can provide human-understandable explanations for reasoning processes, and have found their wide application in knowledge graphs and other downstream tasks. As extracting rules manually from large knowledge graphs is labour-intensive and often infeasible, automated rule learning has recently attracted significant interest, and a number of approaches to rule learning for knowledge graphs have been proposed. This survey aims to provide a review of approaches and a classification of state-of-the-art systems for learning first-order logic rules over knowledge graphs. A comparative analysis of various approaches to rule learning is conducted based on rule language biases, underlying methods, and evaluation metrics. The approaches we consider include inductive logic programming (ILP)-based, statistical path generalisation, and neuro-symbolic methods. Moreover, we highlight important and promising application scenarios of rule learning, such as rule-based knowledge graph completion, fact checking, and applications in other research areas.
@Article{wu_et_al:TGDK.1.1.7,
author = {Wu, Hong and Wang, Zhe and Wang, Kewen and Omran, Pouya Ghiasnezhad and Li, Jiangmeng},
title = {{Rule Learning over Knowledge Graphs: A Review}},
journal = {Transactions on Graph Data and Knowledge},
pages = {7:1--7:23},
ISSN = {2942-7517},
year = {2023},
volume = {1},
number = {1},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.7},
URN = {urn:nbn:de:0030-drops-194813},
doi = {10.4230/TGDK.1.1.7},
annote = {Keywords: Rule learning, Knowledge graphs, Link prediction}
}