Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 72
Página 464
... space , and can be depicted as in Figure 17.11 . At the top of the concept space is the null description , consisting only of variables , and at the bottom are all the possible training instances , which contain no variables . Before we ...
... space , and can be depicted as in Figure 17.11 . At the top of the concept space is the null description , consisting only of variables , and at the bottom are all the possible training instances , which contain no variables . Before we ...
Página 469
... space requirements of the exhaustive , breadth- first search mentioned above . Another is that inconsistent data , also called noise , can cause the candidate elimination algorithm to prune the target concept from the version space ...
... space requirements of the exhaustive , breadth- first search mentioned above . Another is that inconsistent data , also called noise , can cause the candidate elimination algorithm to prune the target concept from the version space ...
Página 538
... space occupied by water . Containers play an important role in the world of liquids . Since we do not want to refer ... space s can hold . The space is FULL when the AMOUNT equals the CAPACITY . CAPACITY ( s ) > AMOUNT ( l , s ) > none ...
... space occupied by water . Containers play an important role in the world of liquids . Since we do not want to refer ... space s can hold . The space is FULL when the AMOUNT equals the CAPACITY . CAPACITY ( s ) > AMOUNT ( l , s ) > none ...
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