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 36
Página 342
... satisfied in the world model . It will be unless we undid one of its components in attempting to satisfy another . In this case , there is no problem and the combined goal can be popped from the stack . Now the top element of the stack ...
... satisfied in the world model . It will be unless we undid one of its components in attempting to satisfy another . In this case , there is no problem and the combined goal can be popped from the stack . Now the top element of the stack ...
Página 343
... satisfied . So we are back to our original goal . In fact , we now have additional goals as well , since other predicates have also been added to the stack . At this point , this path can be terminated as unproductive . If , however ...
... satisfied . So we are back to our original goal . In fact , we now have additional goals as well , since other predicates have also been added to the stack . At this point , this path can be terminated as unproductive . If , however ...
Página 350
... satisfied by some other set of steps . We solve this problem by introducing ordering constraints whenever we employ step addition . In this case , we want to say that each PICKUP step should precede its corresponding STACK step3 ...
... satisfied by some other set of steps . We solve this problem by introducing ordering constraints whenever we employ step addition . In this case , we want to say that each PICKUP step should precede its corresponding STACK step3 ...
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