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 61
Página 23
... human performance at these sorts of tasks : 1. To test psychological theories of human performance . One example of a program that was written for this reason is PARRY [ Colby , 1975 ] , which exploited a model of human paranoid ...
... human performance at these sorts of tasks : 1. To test psychological theories of human performance . One example of a program that was written for this reason is PARRY [ Colby , 1975 ] , which exploited a model of human paranoid ...
Página 325
... Human go players make up for their inability to search deeply by using a great deal of knowledge about the game . It is probable that go - playing programs must also be knowledge - based , since today's brute - force programs cannot ...
... Human go players make up for their inability to search deeply by using a great deal of knowledge about the game . It is probable that go - playing programs must also be knowledge - based , since today's brute - force programs cannot ...
Página 529
... human ( adapted from Lenat and Guha [ 1990 ] ) : System : How old is the patient ? Human ( looking at his 1957 Chevrolet ) : 33 . System : Are there any spots on the patient's body ? Human ( noticing rust spots ) : Yes . System : What ...
... human ( adapted from Lenat and Guha [ 1990 ] ) : System : How old is the patient ? Human ( looking at his 1957 Chevrolet ) : 33 . System : Are there any spots on the patient's body ? Human ( noticing rust spots ) : Yes . System : What ...
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