Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 60
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 ...
Página 405
... present , it is the subject . Otherwise , if I is present , it is the subject . Else the subject is O. These rules can be applied in reverse by a parser to determine the underlying case structure from the superficial syntax . Parsing ...
... present , it is the subject . Otherwise , if I is present , it is the subject . Else the subject is O. These rules can be applied in reverse by a parser to determine the underlying case structure from the superficial syntax . Parsing ...
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