Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 87
Página 55
... kinds of problems for which they are suitable , we will be able to bring to each new problem much of what we have ... kinds of problems and kinds of production systems since all problems can be solved by all kinds of systems . But in a ...
... kinds of problems for which they are suitable , we will be able to bring to each new problem much of what we have ... kinds of problems and kinds of production systems since all problems can be solved by all kinds of systems . But in a ...
Página 94
... kinds of constraints . The first kind are simple ; they just list possible values for a single object . The second kind are more complex ; they describe relationships between or among objects . Both kinds of constraints play the same ...
... kinds of constraints . The first kind are simple ; they just list possible values for a single object . The second kind are more complex ; they describe relationships between or among objects . Both kinds of constraints play the same ...
Página 302
... kinds of novel situations . 11.3.3 Subsymbolic Systems So far , all of the representations that we have discussed are symbolic , in the sense we defined in Section 1.2 . There are alternative representations , many of them based on a ...
... kinds of novel situations . 11.3.3 Subsymbolic Systems So far , all of the representations that we have discussed are symbolic , in the sense we defined in Section 1.2 . There are alternative representations , many of them based on a ...
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