Results 1 
2 of
2
Intelligence without reason
, 1991
"... Computers and Thought are the two categories that together define Artificial Intelligence as a discipline. It is generally accepted that work in Artificial Intelligence over the last thirty years has had a strong influence on aspects of computer architectures. In this paper we also make the converse ..."
Abstract

Cited by 900 (9 self)
 Add to MetaCart
Computers and Thought are the two categories that together define Artificial Intelligence as a discipline. It is generally accepted that work in Artificial Intelligence over the last thirty years has had a strong influence on aspects of computer architectures. In this paper we also make the converse claim; that the state of computer architecture has been a strong influence on our models of thought. The Von Neumann model of computation has lead Artificial Intelligence in particular directions. Intelligence in biological systems is completely different. Recent work in behaviorbased Artificial Intelligence has produced new models of intelligence that are much closer in spirit to biological systems. The nonVon Neumann computational models they use share many characteristics with biological computation.
Abstract An Analysis of Consecutively Bounded DepthFirst Search
"... Consecutively bounded depthfirst search involves repeatedly performing exhaustive depthfirst search with increasing depth bounds of 1, 2, 3, and so on. The effect is similar to that of breadthfirst search, but, instead of retaining the results at level n 1 for use in computing level n, earlier r ..."
Abstract
 Add to MetaCart
(Show Context)
Consecutively bounded depthfirst search involves repeatedly performing exhaustive depthfirst search with increasing depth bounds of 1, 2, 3, and so on. The effect is similar to that of breadthfirst search, but, instead of retaining the results at level n 1 for use in computing level n, earlier results are recomputed. Consecutively bounded depthfirst search is useful whenever a complete search strategy is needed and either it is desirable to minimize memory requirements or depthfirst search can be implemented particularly efficiently. It is notably applicable to automated deduction, especially in logicprogramming systems, such as PROLOG and EQLOG, and their extensions. Consecutively bounded depthfirst search, unlike unbounded breadthfirst search, can perform cutoffs by using heuristic estimates of the minimum number of steps remaining on a solution path. Even if the possibility of such cutoffs is disregarded, an analysis shows that, in general, consecutively bounded depthfirst search requires only b/b1 times as many operations as breadthfirst search, where 6 is the branching factor. 1 1