Rule Induction in Knowledge Graphs Using Linear Programming

We present a simple linear programming (LP) based method to learn compact and interpretable sets of rules encoding the facts in a knowledge graph (KG) and use these rules to solve the KG completion problem. Our LP model chooses a set of rules of bounded complexity from a list of candidate first-order logic rules and assigns weights to them. The complexity bound is enforced via explicit constraints. We combine simple rule generation heuristics with our rule selection LP to obtain predictions with accuracy comparable to state-of-the-art codes, even while generating much more compact rule sets. Furthermore, when we take as input rules generated by other codes, we often improve interpretability by reducing the number of chosen rules, while maintaining accuracy.

Authors

• Sanjeeb Dash IBM Research
• Joao Goncalves IBM Research

Keywords

• DMKM: Linked Open Data, Knowledge Graphs & KB Completion
• DMKM: Rule Mining & Pattern Mining
• KRR: Logic Programming
• SO: Mixed Discrete/Continuous Search