Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 35
Página 514
... connectionist networks is still at a primitive stage . 18.3.1 Connectionist Speech Speech recognition is a difficult perceptual task ( as we see in Chapter 21 ) . Connectionist networks have been applied to a number of problems in ...
... connectionist networks is still at a primitive stage . 18.3.1 Connectionist Speech Speech recognition is a difficult perceptual task ( as we see in Chapter 21 ) . Connectionist networks have been applied to a number of problems in ...
Página 524
... Connectionist knowledge representation offers other advantages besides learnability . Touretzky and Geva [ 1987 ] discuss the fluidity and richness of connectionist represen- tations . In connectionist models , concepts are represented ...
... Connectionist knowledge representation offers other advantages besides learnability . Touretzky and Geva [ 1987 ] discuss the fluidity and richness of connectionist represen- tations . In connectionist models , concepts are represented ...
Página 525
... connectionist framework . Touretzky and Hinton [ 1988 ] describe a connectionist production system , and Derthick [ 1988 ] describes a connectionist semantic network . A third idea is to program a symbolic system with the basic ...
... connectionist framework . Touretzky and Hinton [ 1988 ] describe a connectionist production system , and Derthick [ 1988 ] describes a connectionist semantic network . A third idea is to program a symbolic system with the basic ...
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