Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 86
Página 30
... described as an 8 - by - 8 array where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does not have a legal ...
... described as an 8 - by - 8 array where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does not have a legal ...
Página 285
... described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing ...
... described in the script have occurred . Slots representing objects that are involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing ...
Página 458
... described . If classes are described by scoring functions , then concept learning can be done using the technique of coefficient adjustment described in Section 17.4.1 . If , however , we want to define classes structurally , some other ...
... described . If classes are described by scoring functions , then concept learning can be done using the technique of coefficient adjustment described in Section 17.4.1 . If , however , we want to define classes structurally , some other ...
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