Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 397
... BUILD is produced . If there are variables in the value of BUILD that were bound during the matching of the constituents , then those bindings will be used to build the new constituent . There are many possible variations on the ...
... BUILD is produced . If there are variables in the value of BUILD that were bound during the matching of the constituents , then those bindings will be used to build the new constituent . There are many possible variations on the ...
Página 443
... build up its model of them . Using that model , it can choose the agents to whom it wishes to award bids . The chosen agents perform their tasks and then send reply messages to the manager . At another extreme , suppose we want to build ...
... build up its model of them . Using that model , it can choose the agents to whom it wishes to award bids . The chosen agents perform their tasks and then send reply messages to the manager . At another extreme , suppose we want to build ...
Página 582
... build an English understanding program for the lightbulb - changing robot One to build a speech recognition system One to tell lightbulb jokes to the robot in between bulb - changing tasks One to build a language generation component so ...
... build an English understanding program for the lightbulb - changing robot One to build a speech recognition system One to tell lightbulb jokes to the robot in between bulb - changing tasks One to build a language generation component so ...
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