Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
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 110
... Simple Relational Knowledge The reason that this representation is simple is that standing alone it provides very weak inferential capabilities . But knowledge represented in this form may serve as the input to more powerful inference ...
... Simple Relational Knowledge The reason that this representation is simple is that standing alone it provides very weak inferential capabilities . But knowledge represented in this form may serve as the input to more powerful inference ...
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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain fact frame function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space