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 77
Página 400
... semantic markers . For example , to interpret the sentence about Susan's diamond correctly , we must mark one sense of diamond as SHIMMERABLE , while the other two are marked NONSHIMMERABLE . As the number of such markers grows , the ...
... semantic markers . For example , to interpret the sentence about Susan's diamond correctly , we must mark one sense of diamond as SHIMMERABLE , while the other two are marked NONSHIMMERABLE . As the number of such markers grows , the ...
Página 403
... semantically and thus cannot be generated by a semantic grammar . Consider , for example , the sentence " I want to print stuff.txt on printer3 . " During a strictly syntactic parse , it would not be possible to decide whether the ...
... semantically and thus cannot be generated by a semantic grammar . Consider , for example , the sentence " I want to print stuff.txt on printer3 . " During a strictly syntactic parse , it would not be possible to decide whether the ...
Página 410
... semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form a larger semantic unit . The necessary rules for combining ...
... semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form a larger semantic unit . The necessary rules for combining ...
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