Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 85
Página 56
... things do not change ; new things get created . Nonmonotonic , partially commutative systems , on the other hand , are useful for problems in which changes occur but can be reversed and in which order of operations is not critical ...
... things do not change ; new things get created . Nonmonotonic , partially commutative systems , on the other hand , are useful for problems in which changes occur but can be reversed and in which order of operations is not critical ...
Página 80
... things as " Find examples of a concept you already know . " AM's goal was to generate new " interesting " mathematical concepts . It succeeded in discovering such things as prime numbers and Goldbach's conjecture . Armed solely with its ...
... things as " Find examples of a concept you already know . " AM's goal was to generate new " interesting " mathematical concepts . It succeeded in discovering such things as prime numbers and Goldbach's conjecture . Armed solely with its ...
Página 292
... things exist and what their general properties are . As mentioned above , such a global ontology should provide a ... things without mass , e.g. , sets , numbers , laws , and events . Instances of TangibleObject are things with mass that ...
... things exist and what their general properties are . As mentioned above , such a global ontology should provide a ... things without mass , e.g. , sets , numbers , laws , and events . Instances of TangibleObject are things with mass that ...
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