Learning First-Order Rules with Differentiable Logic Program Semantics
Kun Gao, Katsumi Inoue, Yongzhi Cao, Hanpin Wang

TL;DR
This paper introduces DFOL, a differentiable ILP model that learns first-order logic rules from relational data using neural networks and interpretable matrix representations, enabling scalable and accurate rule induction.
Contribution
The paper presents a novel differentiable ILP approach, DFOL, which learns interpretable first-order logic rules from relational facts using neural network-based matrix representations.
Findings
DFOL outperforms existing differentiable ILP models on standard datasets.
DFOL is scalable and robust in learning first-order rules.
DFOL is computationally efficient and precise.
Abstract
Learning first-order logic programs (LPs) from relational facts which yields intuitive insights into the data is a challenging topic in neuro-symbolic research. We introduce a novel differentiable inductive logic programming (ILP) model, called differentiable first-order rule learner (DFOL), which finds the correct LPs from relational facts by searching for the interpretable matrix representations of LPs. These interpretable matrices are deemed as trainable tensors in neural networks (NNs). The NNs are devised according to the differentiable semantics of LPs. Specifically, we first adopt a novel propositionalization method that transfers facts to NN-readable vector pairs representing interpretation pairs. We replace the immediate consequence operator with NN constraint functions consisting of algebraic operations and a sigmoid-like activation function. We map the symbolic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Bayesian Modeling and Causal Inference
