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 5
Página 11
... corner ) . If Board [ 5 ] is blank , Go ( 5 ) , else Go ( 1 ) . If Board [ 9 ] is blank , Go ( 9 ) , else Go ( 3 ) . If Posswin ( X ) is not 0 , then Go ( Posswin ( X ) ) [ i.e. , block opponent's win ] , else Go ( Make2 ) . If Posswin ...
... corner ) . If Board [ 5 ] is blank , Go ( 5 ) , else Go ( 1 ) . If Board [ 9 ] is blank , Go ( 9 ) , else Go ( 3 ) . If Posswin ( X ) is not 0 , then Go ( Posswin ( X ) ) [ i.e. , block opponent's win ] , else Go ( Make2 ) . If Posswin ...
Página 56
... corner represents commutative systems . Partially commutative , monotonic production systems are useful for solving ignor- able problems . This is not surprising since the definitions of the two are essentially the same . But recall ...
... corner represents commutative systems . Partially commutative , monotonic production systems are useful for solving ignor- able problems . This is not surprising since the definitions of the two are essentially the same . But recall ...
Página 371
... ones becomes even smaller than 18/208 . Thus not only can this approach be extended to larger domains , it must be . Directly above Upper left corner Adjacent to the right Upper 14.3 . UNDERSTANDING AS CONSTRAINT SATISFACTION 371.
... ones becomes even smaller than 18/208 . Thus not only can this approach be extended to larger domains , it must be . Directly above Upper left corner Adjacent to the right Upper 14.3 . UNDERSTANDING AS CONSTRAINT SATISFACTION 371.
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