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 94
Página 114
... procedure is necessary . One way of looking at all the search procedures we have discussed is that they are essentially generate - and - test procedures in which the testing is done after varying amounts of work by the generator . At ...
... procedure is necessary . One way of looking at all the search procedures we have discussed is that they are essentially generate - and - test procedures in which the testing is done after varying amounts of work by the generator . At ...
Página 116
... procedure that makes it possible to look ahead as many moves as possible to see what may occur . Of course , as in other problem - solving domains , the role of search can be altered considerably by alter- ing the amount of knowledge ...
... procedure that makes it possible to look ahead as many moves as possible to see what may occur . Of course , as in other problem - solving domains , the role of search can be altered considerably by alter- ing the amount of knowledge ...
Página 131
... procedure a depth - first or breadth - first search procedure ? 5. The minimax algorithm we have described searches a game tree . But for some games , it might be better to search a graph and to check , each time a posi- tion is ...
... procedure a depth - first or breadth - first search procedure ? 5. The minimax algorithm we have described searches a game tree . But for some games , it might be better to search a graph and to check , each time a posi- tion is ...
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