Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 59
Página 82
... choose as our next node to expand the node that appears to be closest to the goal . This is useful if we care about ... choosing the node that seems closest to a goal If we want to find a path involving the fewest number of steps , then ...
... choose as our next node to expand the node that appears to be closest to the goal . This is useful if we care about ... choosing the node that seems closest to a goal If we want to find a path involving the fewest number of steps , then ...
Página 118
... choose which of the successor moves will be made and thus which terminal value should be backed up to the next level . Suppose we made move B. Then the opponent must choose among moves E , F , and G. The opponent's goal is to minimize ...
... choose which of the successor moves will be made and thus which terminal value should be backed up to the next level . Suppose we made move B. Then the opponent must choose among moves E , F , and G. The opponent's goal is to minimize ...
Página 129
... choose the optimal move . This as- sumption is acceptable in winning situations in which a move that is guaranteed to be good for us can be found . But , as suggested in [ Berliner , 1977 ] , in a losing situation it might be better to ...
... choose the optimal move . This as- sumption is acceptable in winning situations in which a move that is guaranteed to be good for us can be found . But , as suggested in [ Berliner , 1977 ] , in a losing situation it might be better to ...
Otras ediciones - Ver todas
Términos y frases comunes
addition algorithm already answer appear applied approach appropriate Artificial Intelligence attempt better block called Chapter choose clauses combined complete concept consider contains corresponding dependency described discussed domain example exploit explore fact frame function given goal grammar graph heuristic important indicates initial input interpretation involved John kinds knowledge labelings language learning logic look machine Marcus match means methods move natural necessary node objects occur operators particular path patterns perform position possible predicate present problem procedure produce prove question reasoning representation represented result rules satisfied script selected semantic sentence shown in Figure shows simple single situation solution solve space specific stack statement step stored structure Suppose task techniques things tion tree true understanding variety