Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
Página 189
... Knowledge about which paths are most likely to lead quickly to a goal state is often called search control knowledge . It can take many forms : 1. Knowledge about which states are more preferable to others . 2. Knowledge about which ...
... Knowledge about which paths are most likely to lead quickly to a goal state is often called search control knowledge . It can take many forms : 1. Knowledge about which states are more preferable to others . 2. Knowledge about which ...
Página 289
... knowledge and see where the difficulties crop up . In other words , one strategy is to focus temporarily on the content of knowledge bases rather than on their form . Shared Knowledge - Small knowledge - based systems must make ...
... knowledge and see where the difficulties crop up . In other words , one strategy is to focus temporarily on the content of knowledge bases rather than on their form . Shared Knowledge - Small knowledge - based systems must make ...
Página 553
Elaine Rich. 20.4 Knowledge Acquisition How are expert systems built ? Typically , a knowledge engineer interviews a domain expert to elucidate expert knowledge , which is then translated ... KNOWLEDGE ACQUISITION 553 Knowledge Acquisition.
Elaine Rich. 20.4 Knowledge Acquisition How are expert systems built ? Typically , a knowledge engineer interviews a domain expert to elucidate expert knowledge , which is then translated ... KNOWLEDGE ACQUISITION 553 Knowledge Acquisition.
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