Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 71
Página 335
... becomes very large if the problem - state descriptions are complex . For example , suppose that we are interested ... become true and a list of old predicates that it causes to become false . These two lists are called the ADD and DELETE ...
... becomes very large if the problem - state descriptions are complex . For example , suppose that we are interested ... become true and a list of old predicates that it causes to become false . These two lists are called the ADD and DELETE ...
Página 445
... become more complex , it becomes harder to see how best to organize them . One thing that has proved promising is to look for analogies in the organization of other complex systems . One of the most promising sources of such analogies ...
... become more complex , it becomes harder to see how best to organize them . One thing that has proved promising is to look for analogies in the organization of other complex systems . One of the most promising sources of such analogies ...
Página 522
... become larger , i.e. , as the individual units become less discriminating about object locations , the whole representation becomes more accurate , because the regions of intersection become smaller . In the end , we can represent ...
... become larger , i.e. , as the individual units become less discriminating about object locations , the whole representation becomes more accurate , because the regions of intersection become smaller . In the end , we can represent ...
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