Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 11-15 of 47
Page 438
... theorem proving in the predicate cal- culus ( for which exhaustive decision procedures are no longer available ) . We have no space to discuss this area , 25 but it seems clear that a program to solve real mathematical problems will ...
... theorem proving in the predicate cal- culus ( for which exhaustive decision procedures are no longer available ) . We have no space to discuss this area , 25 but it seems clear that a program to solve real mathematical problems will ...
Page 442
... theorem , we will want to know whether the proposed lemmas , or islands in the proof , are e- tually true ; if not , the plan will surely fail . We can often easily tell if a proposition is true by looking at an interpretation . Thus ...
... theorem , we will want to know whether the proposed lemmas , or islands in the proof , are e- tually true ; if not , the plan will surely fail . We can often easily tell if a proposition is true by looking at an interpretation . Thus ...
Page 444
... theorem ( A ^ B ) = ( BAA ) which is obviously useful for removing , or " reduc- ing , " differences of position . GPS applies this method , obtaining ( PQ ) ^ S. GPS now asks what is the Difference between this new expression and the ...
... theorem ( A ^ B ) = ( BAA ) which is obviously useful for removing , or " reduc- ing , " differences of position . GPS applies this method , obtaining ( PQ ) ^ S. GPS now asks what is the Difference between this new expression and the ...
Page 447
... theorem is really understood its content seems to become trivial . ( Still , there may remain a sense of wonder ... theorems " of Godel.38 See Minsky ( 1956 , 1959 ) . " On problems of volition we are in general agreement with McCulloch ...
... theorem is really understood its content seems to become trivial . ( Still , there may remain a sense of wonder ... theorems " of Godel.38 See Minsky ( 1956 , 1959 ) . " On problems of volition we are in general agreement with McCulloch ...
Page 267
... theorem- proving program in logic [ 15 ] , a checker - playing program [ 19 ] , and a pattern recognition program ... theorems in plane geometry , one that did symbolic indefinite integration , a couple of chess programs , a program for ...
... theorem- proving program in logic [ 15 ] , a checker - playing program [ 19 ] , and a pattern recognition program ... theorems in plane geometry , one that did symbolic indefinite integration , a couple of chess programs , a program for ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated base basic behavior capabilities centers complex computer programs computer science computer systems concepts Conf construction cost DENDRAL devices discussion domain elements engineering environment example existing experience exploration Feigenbaum Figure functions GAME goal hardware heuristic programming heuristic search human hypotheses ill-structured problems inference information processing input intelligence and robotics interaction knowledge learning logic machine intelligence man-machine systems manipulators Marvin Minsky mathematical mechanisms memory ment methods Minsky mission operations MYCIN NASA NASA's Natural Language Newell Papers 3d Intl pattern recognition performance planetary planning problem solving problem space problem statement Proc procedure processor Project Project MAC PSYC psychology representation rover rules sensors sequence Simon simplex method solution solver spacecraft Stanford Research Institute Stanford Univ structure Study Group subproblems symbolic task Tech techniques TEIRESIAS teleoperator theory tion