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 84
Página 125
... approach taken in conceptual dependency theory , discussed in Chapter 10. Even for selecting simple structures , such as those representing the meanings of individual words , though , this approach may not be adequate , since many words ...
... approach taken in conceptual dependency theory , discussed in Chapter 10. Even for selecting simple structures , such as those representing the meanings of individual words , though , this approach may not be adequate , since many words ...
Página 242
... approach can be used . For example , in singly connected networks ( those in which there is only a single path between every pair of nodes ) , a simpler algorithm can be used than in the case of multiply connected ones . For details ...
... approach can be used . For example , in singly connected networks ( those in which there is only a single path between every pair of nodes ) , a simpler algorithm can be used than in the case of multiply connected ones . For details ...
Página 410
... approach because it defines the 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 ...
... approach because it defines the 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 ...
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