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 49
Página 399
... meaning " to signify " ; it can be an adjective meaning " unpleasant " or " cheap " ; and it can be a noun meaning “ statistical average . " But now imagine that we have a knowledge base that describes a statistics program and its ...
... meaning " to signify " ; it can be an adjective meaning " unpleasant " or " cheap " ; and it can be a noun meaning “ statistical average . " But now imagine that we have a knowledge base that describes a statistics program and its ...
Página 410
... meaning of each sentence constituent to be a composition of the meanings of its constituents with the meaning of the rule that was used to create it . The main theoretical basis for this approach is modern ( i.e. , post - Fregean ) ...
... meaning of each sentence constituent to be a composition of the meanings of its constituents with the meaning of the rule that was used to create it . The main theoretical basis for this approach is modern ( i.e. , post - Fregean ) ...
Página 425
... meaning of the word " caught " in this discourse , in contrast to its meaning in the discourse , " John threw the ball . Bill caught it . " • The overall discourse must be coherent . Thus , in the discourse , " I needed to deposit some ...
... meaning of the word " caught " in this discourse , in contrast to its meaning in the discourse , " John threw the ball . Bill caught it . " • The overall discourse must be coherent . Thus , in the discourse , " I needed to deposit some ...
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