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 73
Página 377
... building a computational model of language , we will have a powerful tool for communicating about the world . In this chapter , we look at how we can exploit knowledge about the world , in combination with linguistic facts , to build ...
... building a computational model of language , we will have a powerful tool for communicating about the world . In this chapter , we look at how we can exploit knowledge about the world , in combination with linguistic facts , to build ...
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 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
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