Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 58
Página xv
... present both the theoretical foundations of AI and an indication of the ways that current techniques can be used in application programs . As a result of this effort , the book has grown . It is probably no longer possible to cover ...
... present both the theoretical foundations of AI and an indication of the ways that current techniques can be used in application programs . As a result of this effort , the book has grown . It is probably no longer possible to cover ...
Página 232
... present then certain physical characteristics will be observed , then we can use Bayes ' formula to compute , from the evidence we collect , how likely it is that the various minerals are present . This is , in fact , what is done by ...
... present then certain physical characteristics will be observed , then we can use Bayes ' formula to compute , from the evidence we collect , how likely it is that the various minerals are present . This is , in fact , what is done by ...
Página 347
... present a technique for doing this . 13.5 Nonlinear Planning Using Constraint Posting The goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this ...
... present a technique for doing this . 13.5 Nonlinear Planning Using Constraint Posting The goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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