Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 4
Página 53
... tactics could of course help considerably to constrain the search and speed up the execution of the program . But now consider the problem of scanning daily newspapers to decide which are supporting the Democrats and which are ...
... tactics could of course help considerably to constrain the search and speed up the execution of the program . But now consider the problem of scanning daily newspapers to decide which are supporting the Democrats and which are ...
Página 320
... tactics until it does not appear in the portion of the game tree that minimax explores . The horizon effect can also influence a program's perception of good moves . The effect may make a move look good despite the fact that the move ...
... tactics until it does not appear in the portion of the game tree that minimax explores . The horizon effect can also influence a program's perception of good moves . The effect may make a move look good despite the fact that the move ...
Página 321
... tactical , forcing combinations . It employs a purely syntactic criterion , choosing interesting lines of play without recourse to any additional domain knowledge . The DEEP THOUGHT chess computer [ Anantharaman et al . , 1990 ] has ...
... tactical , forcing combinations . It employs a purely syntactic criterion , choosing interesting lines of play without recourse to any additional domain knowledge . The DEEP THOUGHT chess computer [ Anantharaman et al . , 1990 ] has ...
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