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 63
Página 52
... interpretation we need to produce only the interpretation itself . No record of the processing by which the interpretation was found is necessary . Contrast this with the water jug problem . Here it is not sufficient to report that we ...
... interpretation we need to produce only the interpretation itself . No record of the processing by which the interpretation was found is necessary . Contrast this with the water jug problem . Here it is not sufficient to report that we ...
Página 389
... interpretation of the sentence . In this example , if the auxiliary verb interpretation of " have " were chosen first and the end of the sentence appeared with no main verb having been seen , the understander would detect failure and ...
... interpretation of the sentence . In this example , if the auxiliary verb interpretation of " have " were chosen first and the end of the sentence appeared with no main verb having been seen , the understander would detect failure and ...
Página 390
... interpretation , which proves to be wrong . A classic example of this phenomenon , called the garden path sentence , is The horse raced past the barn fell down . Although the problems of deciding which paths to follow and how to handle ...
... interpretation , which proves to be wrong . A classic example of this phenomenon , called the garden path sentence , is The horse raced past the barn fell down . Although the problems of deciding which paths to follow and how to handle ...
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