arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.09806cs.LGcs.AIcs.LO
收藏

学习逻辑程序,发现哪里不搜索

Learning logic programs by discovering where not to search

University of Oxford(牛津大学)

Andrew Cropper, Céline Hocquette

摘要:

归纳逻辑程序设计(ILP)的目标是寻找一个概括训练样本和背景知识(BK)的假设。为了提高性能,我们引入了一种方法,在搜索假设之前,首先发现不搜索的地方。我们使用给定的BK来发现对假设的约束,例如一个数不能既是偶数又是奇数。我们使用的约束引导约束驱动的ILP系统。我们在多个领域(包括程序合成和游戏)的实验表明,我们的方法可以(i)大大减少学习时间高达97%,和(ii)规模的域与数百万的事实。

英文摘要:

The goal of inductive logic programming (ILP) is to search for a hypothesis that generalises training examples and background knowledge (BK). To improve performance, we introduce an approach that, before searching for a hypothesis, first discovers where not to search. We use given BK to discover constraints on hypotheses, such as that a number cannot be both even and odd. We use the constraints to bootstrap a constraint-driven ILP system. Our experiments on multiple domains (including program synthesis and game playing) show that our approach can (i) substantially reduce learning times by up to 97%, and (ii) scale to domains with millions of facts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑