Learning Logic Programs Though Divide, Constrain, and Conquer

We introduce an inductive logic programming approach that combines classical divide-and-conquer search with modern constraint-driven search. Our anytime can learn optimal, recursive, and large programs supports predicate invention. experiments on three domains (classification, general game playing, program synthesis) show our increase predictive accuracies reduce learning times.