Learning logic programs by combining programs
원문 초록
The goal of inductive logic programming is to induce a logic program (a set of logical rules) that generalises training examples. Inducing programs with many rules and literals is a major challenge. To tackle this challenge, we introduce an approach where we learn small non-separable programs and combine them. We implement our approach in a constraint-driven ILP system. Our approach can learn optimal and recursive programs and perform predicate invention. Our experiments on multiple domains, including game playing and program synthesis, show that our approach can drastically outperform existing approaches in terms of predictive accuracies and learning times, sometimes reducing learning times from over an hour to a few seconds.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Relational decomposition for program synthesis
Learning MDL logic programs from noisy data
Learning logic programs by discovering higher-order abstractions
Relational program synthesis with numerical reasoning
Learning programs with magic values
Learning logic programs by discovering where not to search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.