Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 25
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
Elaine Rich. Figure 10.5 shows part of a typical script , the restaurant script ( taken from Schank and Abelson [ 1977 ] ) . It illustrates the important components of a script : Entry conditions Result Props Roles Track Scenes ...
Elaine Rich. Figure 10.5 shows part of a typical script , the restaurant script ( taken from Schank and Abelson [ 1977 ] ) . It illustrates the important components of a script : Entry conditions Result Props Roles Track Scenes ...
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
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's