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 82
Página 60
... discussed . A brief justification is perhaps required before this parade of toy problems is pre- sented . Artificial intelligence is not merely a science of toy problems and microworlds ( such as the blocks world ) . Many of the ...
... discussed . A brief justification is perhaps required before this parade of toy problems is pre- sented . Artificial intelligence is not merely a science of toy problems and microworlds ( such as the blocks world ) . Many of the ...
Página 63
... discussed . These methods are all varieties of heuristic search . They can be described independently of any particular task or problem domain . But when applied to particular problems , their efficacy is highly dependent on the way ...
... discussed . These methods are all varieties of heuristic search . They can be described independently of any particular task or problem domain . But when applied to particular problems , their efficacy is highly dependent on the way ...
Página 418
... discussed techniques for doing this . For example , much of the knowledge described in Chapter 10 is exactly the sort that people presume is shared by other people they are communicating with . Scripts , in particular , have been used ...
... discussed techniques for doing this . For example , much of the knowledge described in Chapter 10 is exactly the sort that people presume is shared by other people they are communicating with . Scripts , in particular , have been used ...
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