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 44
Página 34
... explore other branches . This is called depth - first search . The requirement that a control strategy be systematic corresponds to the need for global motion ( over the course of several steps ) as well as for local motion ( over the ...
... explore other branches . This is called depth - first search . The requirement that a control strategy be systematic corresponds to the need for global motion ( over the course of several steps ) as well as for local motion ( over the ...
Página 56
... explored . Instead of first build- ing the graph explicitly and then searching it , most search programs represent the graph implicitly in the rules and generate explicitly only those parts that they decide to explore . Throughout our ...
... explored . Instead of first build- ing the graph explicitly and then searching it , most search programs represent the graph implicitly in the rules and generate explicitly only those parts that they decide to explore . Throughout our ...
Página 310
... explored to find one that meets all the constraints imposed by a par- ticular sentence . As for any search process , we must decide whether to explore all possible paths or , instead , to explore only a single most likely one and to ...
... explored to find one that meets all the constraints imposed by a par- ticular sentence . As for any search process , we must decide whether to explore all possible paths or , instead , to explore only a single most likely one and to ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraint contains database described discussed domain example expert systems exploit explore fact frame game tree given grammar graph heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP Marcus match minimax move MTRANS MYCIN node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production systems PROLOG propositional logic question reasoning representing knowledge resolution rules satisfied script search procedure search process Section semantic net semantic nets sentence shown in Figure simple situation slots solution solve specific statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding UNSTACK variable variety vertex