Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 25
Página 143
... involved in the production of a proof . This is true even for the simple statements we are using . It would be worse if we had implications with more than a single term on the right or with complicated expressions involving ands and ors ...
... involved in the production of a proof . This is true even for the simple statements we are using . It would be worse if we had implications with more than a single term on the right or with complicated expressions involving ands and ors ...
Página 285
... involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing people who are involved in the events described in the script . The presence ...
... involved in the events described in the script . The presence of these objects can be inferred even if they are not mentioned explicitly . Slots representing people who are involved in the events described in the script . The presence ...
Página 335
... involved in the ON relation are the same ones involved in the UNSTACK operation . This can be said as [ ON ( m , n , s ) ^ ¬ EQUAL ( m , x ) ] → ON ( m , n , DO ( UNSTACK ( x , y ) , s ) ) The advantage of this approach is that a ...
... involved in the ON relation are the same ones involved in the UNSTACK operation . This can be said as [ ON ( m , n , s ) ^ ¬ EQUAL ( m , x ) ] → ON ( m , n , DO ( UNSTACK ( x , y ) , s ) ) The advantage of this approach is that a ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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