3 papers
cs.AI2025
Symmetry breaking for inductive logic programming
Andrew Cropper, David M. Cerna, Matti Järvisalo
The goal of inductive logic programming is to search for a hypothesis that generalises training data and background knowledge. The challenge is searching vast hypothesis spaces, wh…
cs.AI2025
Efficient rule induction by ignoring pointless rules
Andrew Cropper, David M. Cerna
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 ident…
cs.LO2024
Scalable Knowledge Refactoring using Constrained Optimisation
Minghao Liu, David M. Cerna, Filipe Gouveia +1
Knowledge refactoring compresses a logic program by introducing new rules. Current approaches struggle to scale to large programs. To overcome this limitation, we introduce a const…