元规则的逻辑约化
Logical reduction of metarules
摘要:
许多形式的归纳逻辑程序设计(ILP)使用\emph{metarules},二阶Horn子句,来定义可学习程序的结构,从而定义假设空间。决定哪些元规则用于给定的学习任务是一个主要的开放问题,并且是效率和表现力之间的权衡:假设空间随着元规则的增加而增长,所以我们希望使用更少的元规则,但是如果我们使用太少的元规则,那么我们就会失去表现力。本文研究了元规则的碎片是否可以逻辑约简为极小有限子集。我们考虑两种传统形式的逻辑还原:包容和蕴涵。我们还考虑了一种新的减少技术称为\emph{derivation reduction},这是基于SLD分辨率。我们计算减少集的元片段相关的ILP和理论上表明这些减少集是否减少更一般的无限片段。我们的实验比较学习减少集元规则的三个领域:Michalski火车,字符串变换和游戏规则。一般来说,推导缩减集的元规则优于包容和蕴涵缩减集,无论是在预测精度和学习时间。
英文摘要:
Many forms of inductive logic programming (ILP) use \emph{metarules}, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of logical reduction: subsumption and entailment. We also consider a new reduction technique called \emph{derivation reduction}, which is based on SLD-resolution. We compute reduced sets of metarules for fragments relevant to ILP and theoretically show whether these reduced sets are reductions for more general infinite fragments. We experimentally compare learning with reduced sets of metarules on three domains: Michalski trains, string transformations, and game rules. In general, derivation reduced sets of metarules outperforms subsumption and entailment reduced sets, both in terms of predictive accuracies and learning times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。