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 64
Página 78
... applying an appropriate heuristic function to each of them . We then expand the chosen node by using the rules to generate its ... applied to them . Now another path , that going through node B , looks more promising , so it is pursued ...
... applying an appropriate heuristic function to each of them . We then expand the chosen node by using the rules to generate its ... applied to them . Now another path , that going through node B , looks more promising , so it is pursued ...
Página 99
... applied to the current state . So we set up a subproblem of getting to a state in which it can be applied . And maybe the operator does not produce exactly the goal state we want . Then we have a second subproblem of getting from the ...
... applied to the current state . So we set up a subproblem of getting to a state in which it can be applied . And maybe the operator does not produce exactly the goal state we want . Then we have a second subproblem of getting from the ...
Página 269
... applied . We have also assumed that they will therefore be true after it is applied . But what if the operator does something that interferes with one of these goals and causes it no longer to be true ? We must check for that . Rather ...
... applied . We have also assumed that they will therefore be true after it is applied . But what if the operator does something that interferes with one of these goals and causes it no longer to be true ? We must check for that . Rather ...
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