Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 87
Página 46
... Simple Blocks World Problem ON ( B , C ) and ON ( A , B ) ON ( B , C ) Put B on C ON ( B , C ) ON ( A , B ) CLEAR ( A ) ON ( A , B ) Move A to table Put A on B ON ( A , B ) CLEAR ( A ) Figure 2.11 : A Proposed Solution for the Blocks ...
... Simple Blocks World Problem ON ( B , C ) and ON ( A , B ) ON ( B , C ) Put B on C ON ( B , C ) ON ( A , B ) CLEAR ( A ) ON ( A , B ) Move A to table Put A on B ON ( A , B ) CLEAR ( A ) Figure 2.11 : A Proposed Solution for the Blocks ...
Página 136
... simple example , we see that three important issues must be addressed in the process of converting English sentences into logical statements and then using those statements to deduce new ones : • Many English sentences are ambiguous ...
... simple example , we see that three important issues must be addressed in the process of converting English sentences into logical statements and then using those statements to deduce new ones : • Many English sentences are ambiguous ...
Página 309
... simple static evaluation function for chess based on piece advantage was proposed by Turing — simply add the values of black's pieces ( B ) , the values of white's pieces ( W ) , and then compute the quotient W / B . A more ...
... simple static evaluation function for chess based on piece advantage was proposed by Turing — simply add the values of black's pieces ( B ) , the values of white's pieces ( W ) , and then compute the quotient W / B . A more ...
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