Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 37
Page 408
... rules for play and scoring . In one sense all such problems are trivial . For if there exists a solution to such a problem , that solution can be found eventually by any blind exhaustive process which searches through all possibilities ...
... rules for play and scoring . In one sense all such problems are trivial . For if there exists a solution to such a problem , that solution can be found eventually by any blind exhaustive process which searches through all possibilities ...
Page 432
... rule that provided the subgoal . ) . . . This also is true of the other kinds of structure : every tactic that is created provides information about the success or failure of tactic search rules ; every opponent's action provides ...
... rule that provided the subgoal . ) . . . This also is true of the other kinds of structure : every tactic that is created provides information about the success or failure of tactic search rules ; every opponent's action provides ...
Page 435
... rules are defined with absolute clarity . The " Logic Theory " machine of Newell and Simon ( 1956a , 1957a ) , called " LT " below , was a first attempt to prove theorems in logic , by frankly heuristic methods . Although the program ...
... rules are defined with absolute clarity . The " Logic Theory " machine of Newell and Simon ( 1956a , 1957a ) , called " LT " below , was a first attempt to prove theorems in logic , by frankly heuristic methods . Although the program ...
Page 436
... rules of inference ) . If one is found , the problem is solved . Or the search might fail completely . But finally , the search may yield one or more " problems " which are usually propositions from which T may be deduced directly . If ...
... rules of inference ) . If one is found , the problem is solved . Or the search might fail completely . But finally , the search may yield one or more " problems " which are usually propositions from which T may be deduced directly . If ...
Page 441
... rule of the back - up variety ( Sec . IIIC ) . ( Note : we are identifying here the move - tree - limitation problem with that of problem selection . ) Even though extensive experimental results are not yet avail- able , we feel that ...
... rule of the back - up variety ( Sec . IIIC ) . ( Note : we are identifying here the move - tree - limitation problem with that of problem selection . ) Even though extensive experimental results are not yet avail- able , we feel that ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated base basic behavior Chart chess complex computer science concepts Conf construction DENDRAL domain element engineering example experience Feigenbaum Feldman Figure function GAME generate-and-test goal H. A. Simon heuristic programming heuristic search human hypotheses ill-structured problems inference Information Processing input intelligence and robotics INTERLISP knowledge logic Logic Theorist machine intelligence manipulators mathematical mechanisms Memo memory methods Michie Minsky mission operations MYCIN NASA NASA's Natural Language Newell ORGANISM-1 Papers 3d Intl pattern recognition performance problem solving problem space problem statement Proc procedure Project Project MAC PSYC psychology representation rover rules Semantic sensors sequence Simon simplex method Slagle solution solver spacecraft Stanford Research Institute Stanford Univ structure Study Group symbolic task Tech techniques TEIRESIAS teleoperator theorem proving theory tion variables York