Efficient Rule Induction by Ignoring Pointless Rules

The goal of inductive logic programming (ILP) is to find a set of logical rules that generalises training examples and background knowledge. We introduce an ILP approach that identifies pointless rules. A rule is pointless if it contains a logically redundant literal or cannot discriminate against negative examples. We show that ignoring pointless rules allows an ILP system to efficiently and soundly prune the hypothesis space. Our experiments on multiple domains, including visual reasoning and game playing, show that our approach can reduce learning times by 99% whilst maintaining predictive accuracies.