The heuristic of George Polya and its relation to artificial intelligence
The heuristic of George Polya and its relation to artificial intelligence
复制标题
DOI：
10.1184/r1/6610595.v1
复制
发表时间：
1981-07
期刊：
影响因子：
--
通讯作者：
A. Newell
中科院分区：
文献类型：
--
作者：
A. Newell
摘要：Polya在启发式方面的基础性工作在人工智能领域是众所周知的，也是备受重视的。然而，没有人认真地在他的工作基础上进行构建，例如，通过构建利用他的启发式的程序。本文试图理解为什么会出现这种情况。首先，尝试描述波利亚启发式的性质。然后提出了六个论点，这可能解释了他的工作未能产生重大影响。其中三个很容易被抛弃，但有三个是严肃的候选人：基本的启发式知识没有在Polya的工作中被捕获；Polya的启发式对学习的强调超越了当前人工智能领域的艺术；而且辅助问题的使用超出了目前的技术。最后一篇论文将在本文的剩余部分进行详细的探讨。出现了一些有趣的概念，特别是以对象为中心的问题空间的概念以及温和子问题和复杂子问题之间的对比。
Abstract : Polya's fundamental work in heuristic is well known and well regarded in artificial intelligence. However, no one has built seriously on his work, e. g., by constructing programs that make use of his heuristic. This paper attempts to understand why this might be the case. First, an attempt is made to characterize the nature of Polya's heuristic. Then six theses are put forward that might account for the failure of his work to have a major impact. Three are easily discarded, but three are serious candidates: that the essential heuristic knowledge is not captured in Polya's work; that the emphasis on learning in Polya's heuristic is beyond the current art in artificial intelligence; and that the use of auxiliary problems is beyond the current art. This last thesis is explored in detail in the remainder of the paper. Some interesting concepts emerge, particularly the notion of object-centered problem space and the contrast between tame and wild subproblems.