A differentiable first-order rule learner for inductive logic programming

Kun Gao

doi:10.1016/j.artint.2024.104108

2024-06-01

PRE

DOI：10.1016/j.artint.2024.104108

原文链接

原文求助

摘要

En 中文

Learning first -order logic programs from relational facts yields intuitive insights into the data. Inductive logic programming (ILP) models are effective in learning first -order logic programs from observed relational data. Symbolic ILP models support rule learning in a data -efficient manner. However, symbolic ILP models are not robust to learn from noisy data. Neuro-symbolic ILP models utilize neural networks to learn logic programs in a differentiable manner which improves the robustness of ILP models. However, most neuro-symbolic methods need a strong language bias to learn logic programs, which reduces the usability and flexibility of ILP models and limits the logic program formats. In addition, most neuro-symbolic ILP methods cannot learn logic programs effectively from both small -size datasets and large -size datasets such as knowledge graphs. In the paper, we introduce a novel differentiable ILP model called differentiable firstorder rule learner (DFORL), which is scalable to learn rules from both smaller and larger datasets. Besides, DFORL only needs the number of variables in the learned logic programs as input. Hence, DFORL is easy to use and does not need a strong language bias. We demonstrate that DFORL can perform well on several standard ILP datasets, knowledge graphs, and probabilistic relation facts and outperform several well-known differentiable ILP models. Experimental results indicate that DFORL is a precise, robust, scalable, and computationally cheap differentiable ILP model.

Keyword:

Machine learning

Differentiable inductive logic programming

Interpretability

Neuro-symbolic method