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 63
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
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