Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 155
... show how resolution can be used to prove new things about him . Let's first consider the set of statements introduced ... shows a resolution proof of the statement hate ( Marcus , Caesar ) Of course , many more resolvents could have been ...
... show how resolution can be used to prove new things about him . Let's first consider the set of statements introduced ... shows a resolution proof of the statement hate ( Marcus , Caesar ) Of course , many more resolvents could have been ...
Página 216
... shows such a justification added to the network and a consistent labeling for that network , which shows Suspect Abbott labeled IN . That Abbot is the primary suspect represents an initial state of the murder investi- gation ...
... shows such a justification added to the network and a consistent labeling for that network , which shows Suspect Abbott labeled IN . That Abbot is the primary suspect represents an initial state of the murder investi- gation ...
Página 440
... show a snapshot of a HEARSAY - II blackboard . Figure 16.2 shows the lowest three levels of the blackboard , and Figure 16.3 shows the top three . The levels are the following : a . The waveform corresponding to the sentence " Are any ...
... show a snapshot of a HEARSAY - II blackboard . Figure 16.2 shows the lowest three levels of the blackboard , and Figure 16.3 shows the top three . The levels are the following : a . The waveform corresponding to the sentence " Are any ...
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