7 citations · 19 across the 17 of their papers we have counts for
3 papers · 1 filter
Learning MDL logic programs from noisy data
Céline Hocquette, Andreas Niskanen, Matti Järvisalo +1
Many inductive logic programming approaches struggle to learn programs from noisy data. To overcome this limitation, we introduce an approach that learns minimal description length…
Learning logic programs by discovering higher-order abstractions
Céline Hocquette, Sebastijan Dumančić, Andrew Cropper
We introduce the higher-order refactoring problem, where the goal is to compress a logic program by discovering higher-order abstractions, such as map, filter, and fold. We impleme…
Generalisation Through Negation and Predicate Invention
David M. Cerna, Andrew Cropper
The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP…