• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Genetic and Evolutionary Computation Conference: A Joint Meeting of the Sixth Annual Genetic Programming Conference (GP-2001) and the Tenth International Conference on Genetic Algorithms (ICGA-2001), Jul 7-11, 2001, San Francisco, California >Adaptive Logic Programming
【24h】

Adaptive Logic Programming

机译：自适应逻辑编程

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A new hybrid of Evolutionary Automatic Programming which employs logic programs is presented. In contrast with tree-based methods, it employs a simple GA on variable length strings containing integers. The strings represent sequences of choices used in the derivation of non-deterministic logic programs. A family of Adaptive Logic Programming systems (ALPs) are proposed and from those, two promising members are examined. A proof of principle of this approach is given by running the system on three problems of increasing grammatical difficulty. Although the initialization routine might need improvement, the system as presented here provides a feasible approach to the induction of solutions in grammatically and logically constrained languages.
机译：提出了一种采用逻辑程序的进化自动编程的新混合体。与基于树的方法相比，它对包含整数的可变长度字符串采用简单的GA。字符串代表在非确定性逻辑程序推导中使用的选择序列。提出了一系列自适应逻辑编程系统（ALP），并从中检查了两个有希望的成员。通过在增加语法难度的三个问题上运行系统，给出了这种方法的原理证明。尽管初始化例程可能需要改进，但此处介绍的系统提供了一种可行的方法，可以用语法和逻辑约束语言来导出解决方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号