Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 51
Página 25
... machine . The goal of the machine is to fool the interrogator into believing that it is the person . If the machine succeeds at this , then we will conclude that the machine can think . The machine is allowed to do whatever it can to ...
... machine . The goal of the machine is to fool the interrogator into believing that it is the person . If the machine succeeds at this , then we will conclude that the machine can think . The machine is allowed to do whatever it can to ...
Página 585
... Machine Intelligence , vol . 10 , ed . J. E. Hayes , D. Michie , and Y. H. Pao , 269–299 . Edinburgh : Edinburgh University Press . Buchanan , B. G. and E. H. Shortliffe . 1984. Rule - Based Expert Systems : The MYCIN Experiments of the ...
... Machine Intelligence , vol . 10 , ed . J. E. Hayes , D. Michie , and Y. H. Pao , 269–299 . Edinburgh : Edinburgh University Press . Buchanan , B. G. and E. H. Shortliffe . 1984. Rule - Based Expert Systems : The MYCIN Experiments of the ...
Página 596
... Machine transformation of advice into a heuristic search procedure . In Machine Learning , An Artificial Intelligence Approach , ed . R. S. Michalski , J. G. Carbonell , and T. M. Mitchell . Palo Alto , CA : Tioga Press . Nagao , M ...
... Machine transformation of advice into a heuristic search procedure . In Machine Learning , An Artificial Intelligence Approach , ed . R. S. Michalski , J. G. Carbonell , and T. M. Mitchell . Palo Alto , CA : Tioga Press . Nagao , M ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space