Induction of Logic Programs with More Than One Recursive Clause by Analyzing Saturations
Induction of Logic Programs with More Than One Recursive Clause by Analyzing Saturations
复制标题
通过饱和分析归纳具有多个递归子句的逻辑程序
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
H. Itoh
中科院分区：
文献类型：
--
作者：
Mitsue Furusawa;Nobuhiro Inuzuka;H. Seki;H. Itoh
本文描述了一个自底向上的ILP算法MRI，它从一些例子中归纳出带有一个或多个递归子句的递归程序。它使用路径结构来分析饱和度，路径结构表示由谓词处理的术语流，最初由Identam-Almquist引入。介绍了路结构的扩张和差。递归子句可以表示为路径结构之间的差异。文中还给出了实验结果。
This paper describes a bottom-up ILP algorithm called MRI, which induces recursive programs with one or more recursive clauses from a few of examples. It analyzes saturations using path structures, which express streams of terms processed by predicates and was originally introduced by Identam-Almquist. We introduce extension and difference of path structures. Recursive clauses can be expressed as a difference among path structures. The paper also shows experimental results.