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 48
Página 10
... position is best ( as described below ) , make the move that leads to that position , and pass the rating of that best move up as the rating of the current position . To decide which of a set of board positions is best , do the ...
... position is best ( as described below ) , make the move that leads to that position , and pass the rating of that best move up as the rating of the current position . To decide which of a set of board positions is best , do the ...
Página 26
... position can be described as an 8- by - 8 array , where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does ...
... position can be described as an 8- by - 8 array , where each position contains a symbol standing for the appropriate piece in the official chess opening position . We can define as our goal any board position in which the opponent does ...
Página 124
... position to describe the operation of the function MINIMAX - A - B , which will require four arguments , POSITION , DEPTH , USE - THRESH , and PASS - THRESH . The initial call , to choose a move from the position represented by CURRENT ...
... position to describe the operation of the function MINIMAX - A - B , which will require four arguments , POSITION , DEPTH , USE - THRESH , and PASS - THRESH . The initial call , to choose a move from the position represented by CURRENT ...
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