【24h】

Predicate Invention from a Few Examples

机译:来自几个例子的谓词发明

获取原文

摘要

One main difficulty of Inductive Logic Programming lies in learning recursively defined predicates. Today's systems strongly rely on a set of supporting predicates known as the background knowledge, which assumes that the user knows in advance what sort of predicates are required by the target definition. Predicate invention can remedy the situation by extending the speccification language with new concepts that appear netiher in the examples nor in the background knowledge, and finding a definition for them. A serious concern is that no examples of the invented predicate are explicitly given but rather of the target predicate, so learning has to be done in the absence or scarcity of examples. This work shows an autonomous leanring method based on inverting clausal implication that can ivnent the recursive predicates it needs. The learner is endowed with means to work from a small data set.
机译:感应逻辑编程的一个主要难度在于学习递归定义的谓词。今天的系统强烈地依赖于已知作为背景知识的一组支持谓词,这假设用户预先知道目标定义需要哪种谓词。谓词发明可以通过扩展具有新概念的标识语言来弥补情况,这些概念在示例中显示Netiher,也不在背景知识中找到定义。一个严重的问题是,没有明确地解释发明谓词的例子,而是目标谓词,因此必须在缺乏或稀缺的情况下进行学习。这项工作显示了一种基于反相的人的自主倾斜方法,可以阻止它需要的递归谓词。学习者被赋予了从小数据集工作的手段。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号