Abstract: Inductive logic programming is a new method for data mining, which is based on the first-order logic. The first-order rule mining is the complicated combination optimal problem of atoms constructed by target predicate and background predicates. This paper proposes the bit-string encoding of first-order rule based on the Occam’s razor principle, designs the corresponding genetic operators, and presents the algorithm of Genetic Inductive Logic Programming(GILP) based on the sequential covering strategy and adopts genetic algorithm as the search method. It validates the feasibility of GILP algorithm through the connectivity of graphic and gcd problem.

Key words: genetic algorithm, inductive logic programming, bit-string encoding

摘要： 归纳逻辑程序设计是基于一阶逻辑的数据挖掘新方法。一阶规则挖掘是目标谓词和背景知识谓词对应的各种原子的复杂组合优化问题。该文根据Occam’s razor原理提出原子的位串编码，设计相应的遗传算子，基于sequential covering策略提出采用遗传算法作为搜索策略的遗传归纳逻辑程序设计算法GILP。在连通图问题和gcd问题上验证算法的可行性。

关键词: 遗传算法, 归纳逻辑程序设计, 位串编码

CLC Number: 

• TP181