Learning logic programs by finding minimal unsatisfiable subprograms

2024/01/29 by Cropper, Andrew, Hocquette, Céline
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Machine Learning (cs.LG)

paper · doi:10.48550/arxiv.2401.16383

Abstract

The goal of inductive logic programming (ILP) is to search for a logic program that generalises training examples and background knowledge. We introduce an ILP approach that identifies minimal unsatisfiable subprograms (MUSPs). We show that finding MUSPs allows us to efficiently and soundly prune the search space. Our experiments on multiple domains, including program synthesis and game playing, show that our approach can reduce learning times by 99%.

Related

• Learning logic programs by discovering where not to search
• Learning logic programs by combining programs
• Learning logic programs through divide, constrain, and conquer
• Inductive logic programming at 30
• Preprocessing in Inductive Logic Programming