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 67
Página 128
... initial state description at all . At each node , store an indication of the specific changes that should be made at this node . Whenever it is necessary to refer to the description of the current problem state , look at the initial ...
... initial state description at all . At each node , store an indication of the specific changes that should be made at this node . Whenever it is necessary to refer to the description of the current problem state , look at the initial ...
Página 338
... initial problem state into the goal state . How will it know when this has been done ? In simple problem - solving systems , this question is easily answered by a straightforward match of the state descriptions . But if entire states ...
... initial problem state into the goal state . How will it know when this has been done ? In simple problem - solving systems , this question is easily answered by a straightforward match of the state descriptions . But if entire states ...
Página 350
... initial state . * CLEAR ( B ) is unachieved because although B is clear in the initial state , there ex- ists a step STACK ( A , B ) with postcondition ¬CLEAR ( B ) , and that step might precede the step with * CLEAR ( B ) as a ...
... initial state . * CLEAR ( B ) is unachieved because although B is clear in the initial state , there ex- ists a step STACK ( A , B ) with postcondition ¬CLEAR ( B ) , and that step might precede the step with * CLEAR ( B ) as 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