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 23
Página 21
... script is instantiated for this text , and because of the last sentence , the path through step 14 of the script is the one that is used in forming the representation of this text . When the script is instantiated M ' is bound to the ...
... script is instantiated for this text , and because of the last sentence , the path through step 14 of the script is the one that is used in forming the representation of this text . When the script is instantiated M ' is bound to the ...
Página 285
... script ( taken from Schank and Abelson [ 1977 ] ) . It illustrates the important components of a script : Entry conditions Result Props Roles Track Scenes Conditions that must , in general , be satisfied before the events de- scribed in ...
... script ( taken from Schank and Abelson [ 1977 ] ) . It illustrates the important components of a script : Entry conditions Result Props Roles Track Scenes Conditions that must , in general , be satisfied before the events de- scribed in ...
Página 287
... script should be activated . In order to cut down on the number of times a spurious script is activated , it has proved useful to require that a situation contain at least two of a script's headers before the script will be activated ...
... script should be activated . In order to cut down on the number of times a spurious script is activated , it has proved useful to require that a situation contain at least two of a script's headers before the script will be activated ...
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