| 归纳逻辑程序设计中的优化问题研究 |
| |
| 引用本文： | 叶风,徐晓飞.归纳逻辑程序设计中的优化问题研究[J].计算机研究与发展,1999,36(5):560-566. |
| |
| 作者姓名： | 叶风 徐晓飞 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系 |
| |
| 基金项目： | 国家“八六三”高技术计划基金 |
| |
| 摘 要： | 归纳逻辑程序设计的核心问题是如何从背景知识中优选谓词构造满足约束的归纳假设，按Ｏｃｃａｍ准则，满足约束的最精简归纳假设为优，但迄今归纳逻辑程序设计中精简归纳假设构造的计算复杂性尚未解决。
|
| 关 键 词： | 归纳学习 归纳逻辑程序 程序设计 优化 |
ON OPTIMAL PROBLEMS IN INDUCTIVE LOGIC PROGRAMMING |
| |
| YE Feng,XU Xiao\|Fei,QUAN Guang\|Ri,CHEN Bin,and QIU Shen\|Shan.ON OPTIMAL PROBLEMS IN INDUCTIVE LOGIC PROGRAMMING[J].Journal of Computer Research and Development,1999,36(5):560-566. |
| |
| Authors: | YE Feng XU Xiao\|Fei QUAN Guang\|Ri CHEN Bin and QIU Shen\|Shan |
| |
| Abstract: | The essential issue in inductive logic programming is how to construct inductive hypotheses with optimal predicates selected from background knowledge and constrains satisfied.According to Occam's principle,the simplest inductive hypotheses are the best.The computational complexity of constructing simplest inductive hypotheses,however,has not been fully investigated.Based on extension matrix,the main optimal problems in ILP are proven to be NP hard.A heuristic algorithm is then presented to solve the problems.The experiments show that the algorithm has superiority in the structures of inductive hypotheses produced. |
| |
| Keywords: | Inductive learning inductive logic programming extension matrix computational complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
