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 3
Página 116
... forcing them to be declared and then checking each time a value is added to one attribute that the corresponding value is added to the inverse . An Isa Hierarchy of Attributes Just as there are classes 116 CHAPTER 4. KNOWLEDGE ...
... forcing them to be declared and then checking each time a value is added to one attribute that the corresponding value is added to the inverse . An Isa Hierarchy of Attributes Just as there are classes 116 CHAPTER 4. KNOWLEDGE ...
Página 321
... forcing combinations . It employs a purely syntactic criterion , choosing interesting lines of play without recourse to any additional domain knowledge . The DEEP THOUGHT chess computer [ Anantharaman et al . , 1990 ] has used singular ...
... forcing combinations . It employs a purely syntactic criterion , choosing interesting lines of play without recourse to any additional domain knowledge . The DEEP THOUGHT chess computer [ Anantharaman et al . , 1990 ] has used singular ...
Página 457
... forcing the problem solver to consider them . If we only want to minimize the number of node expansions in the search space , then the more control rules we learn , the better . But if we want to minimize the total CPU time required to ...
... forcing the problem solver to consider them . If we only want to minimize the number of node expansions in the search space , then the more control rules we learn , the better . But if we want to minimize the total CPU time required to ...
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