Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 86
Página 89
... step 2 , node D is chosen for expansion . This process produces one new arc , the AND arc to E and F , with a combined cost estimate of 10. So we update the f ' value of D to 10. Going back one more level , we see that this makes the ...
... step 2 , node D is chosen for expansion . This process produces one new arc , the AND arc to E and F , with a combined cost estimate of 10. So we update the f ' value of D to 10. Going back one more level , we see that this makes the ...
Página 108
... step then results in the following situation : The third step then yields : A B ( 4 + 1 ) C ( 3 + 1 ) A D ( 4 + 2 ) ( 4 + 1 ) B C ( 3 + 1 ) ( 2 + 2 ) E D ( 4 + 2 ) a . What node will be expanded at the next step ? b . Can we guarantee ...
... step then results in the following situation : The third step then yields : A B ( 4 + 1 ) C ( 3 + 1 ) A D ( 4 + 2 ) ( 4 + 1 ) B C ( 3 + 1 ) ( 2 + 2 ) E D ( 4 + 2 ) a . What node will be expanded at the next step ? b . Can we guarantee ...
Página 249
... step of the process we can be sure of the outcome of that step ; it is whatever happened . But in an unpredictable universe , we cannot know the outcome of a solution step if we are only simulating it by computer . At best , we can ...
... step of the process we can be sure of the outcome of that step ; it is whatever happened . But in an unpredictable universe , we cannot know the outcome of a solution step if we are only simulating it by computer . At best , we can ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY Artificial Intelligence backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraints contains database described discussed domain example exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings LISP Marcus match methods minimax move MYCIN natural language necessary node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production system PROLOG propositional logic question reasoning representing knowledge rules Schank script search procedure search process Section semantic net sentence shown in Figure simple situation slots solution solve specific stack statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding variety