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 4
Página 64
... arrangement of the cubes in a row such that on all four sides of the row one block face of each color is showing . This problem can be solved by a person ( who is a much slower processor for this sort of thing than even a very cheap ...
... arrangement of the cubes in a row such that on all four sides of the row one block face of each color is showing . This problem can be solved by a person ( who is a much slower processor for this sort of thing than even a very cheap ...
Página 110
... arranged in a generalization hierarchy . Figure 4.5 shows some additional baseball knowledge inserted into a structure that is so arranged . Lines represent attributes . Boxed nodes represent objects and values of attributes of objects ...
... arranged in a generalization hierarchy . Figure 4.5 shows some additional baseball knowledge inserted into a structure that is so arranged . Lines represent attributes . Boxed nodes represent objects and values of attributes of objects ...
Página 269
... arrangement of slots in an isa hi- erarchy . The relation color is a fairly general one that holds between physical objects and colors . The attribute uniform - color is a restricted form of color that applies only between team players ...
... arrangement of slots in an isa hi- erarchy . The relation color is a fairly general one that holds between physical objects and colors . The attribute uniform - color is a restricted form of color that applies only between team players ...
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