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 6
Página 371
... labelings ( equivalent to that developed by Clowes [ 1971 ] ) . This list is shown in Figure 14.17 . Notice that of the 208 labelings that we said were theoretically possible , only eighteen are physically possible . Thus we have found ...
... labelings ( equivalent to that developed by Clowes [ 1971 ] ) . This list is shown in Figure 14.17 . Notice that of the 208 labelings that we said were theoretically possible , only eighteen are physically possible . Thus we have found ...
Página 373
... labelings that are possible for it . Then we move to an adjacent vertex and find all of its possible labelings . The line that we followed to get from the first vertex to the second must end up with only one label , and that label must ...
... labelings that are possible for it . Then we move to an adjacent vertex and find all of its possible labelings . The line that we followed to get from the first vertex to the second must end up with only one label , and that label must ...
Página 375
... labeling for V , there is a way to label the line between V and A in such a way that at least one of the labelings listed for A is still possible . Eliminate from V's list any labeling for which this is not the case . ( c ) Use the set ...
... labeling for V , there is a way to label the line between V and A in such a way that at least one of the labelings listed for A is still possible . Eliminate from V's list any labeling for which this is not the case . ( c ) Use the set ...
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