Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 59
Página 11
... strategy or to change the strategy if desired . But the total strategy has still been figured out in advance by the programmer . Any bugs in the programmer's tic - tac - toe playing skill will show up in the program's play . And we ...
... strategy or to change the strategy if desired . But the total strategy has still been figured out in advance by the programmer . Any bugs in the programmer's tic - tac - toe playing skill will show up in the program's play . And we ...
Página 37
... strategy is that it be systematic . Here is another simple control strategy for the water jug problem : On each cycle , choose at random from among the applicable rules . This strategy is better than the first . It causes motion . It ...
... strategy is that it be systematic . Here is another simple control strategy for the water jug problem : On each cycle , choose at random from among the applicable rules . This strategy is better than the first . It causes motion . It ...
Página 54
... strategy the program takes to find the proof . It can use , for example , the resolution procedure ( see Chapter 5 ) , which can be very efficient but which does not appear natural to people . But if either of those conditions is ...
... strategy the program takes to find the proof . It can use , for example , the resolution procedure ( see Chapter 5 ) , which can be very efficient but which does not appear natural to people . But if either of those conditions is ...
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