Improving Scalability of Inductive Logic Programming via Pruning and Best-Effort Optimisation.

•Pruning in hypothesis generalization algorithm enables learning from larger dataset.•Using latest optimization methods for better usage of modern solver technology.•Adding a time budget allowing the usage of suboptimal results in XHAIL.•Obtaining competitive results and explainable hypotheses in sentence chunking.