Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 62
Página 57
... tree structure in which each node represents a problem state and each arc represents a relationship between the states represented by the nodes it connects . For example , Figure 2.18 shows part of a search tree for a water jug problem ...
... tree structure in which each node represents a problem state and each arc represents a relationship between the states represented by the nodes it connects . For example , Figure 2.18 shows part of a search tree for a water jug problem ...
Página 58
... tree . For example , in the tree shown in Figure 2.18 , the node ( 4 , 3 ) , representing 4 gallons of water in one jug and 3 gallons in the other , can be generated either by first filling the 4 - gallon jug and then the 3 - gallon one ...
... tree . For example , in the tree shown in Figure 2.18 , the node ( 4 , 3 ) , representing 4 gallons of water in one jug and 3 gallons in the other , can be generated either by first filling the 4 - gallon jug and then the 3 - gallon one ...
Página 449
... tree . When it finished searching the tree and propagating the values backward , it had a score for the position represented by the root of the tree . It could then choose the best move and make it . But it also recorded the board ...
... tree . When it finished searching the tree and propagating the values backward , it had a score for the position represented by the root of the tree . It could then choose the best move and make it . But it also recorded the board ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's