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 19
Página 350
... Labeling - Attach to each of the segments a label that indicates which , of a set of building blocks , that segment ... labeled segments together to form a coherent object . This is the stage about which the fewest generalizations can ...
... Labeling - Attach to each of the segments a label that indicates which , of a set of building blocks , that segment ... labeled segments together to form a coherent object . This is the stage about which the fewest generalizations can ...
Página 356
... labeled . New constraints will arise from this labeling and these constraints can be propagated back to vertices that have already been labeled , so that the set of possible labelings for them is further reduced . This process proceeds ...
... labeled . New constraints will arise from this labeling and these constraints can be propagated back to vertices that have already been labeled , so that the set of possible labelings for them is further reduced . This process proceeds ...
Página 357
... labeling a vertex next to one that has already been labeled , maximum use can be made of the con- straints . 3. Visit each vertex V in order and attempt to label it by doing the following : 1. Using the set of possible vertex labelings ...
... labeling a vertex next to one that has already been labeled , maximum use can be made of the con- straints . 3. Visit each vertex V in order and attempt to label it by doing the following : 1. Using the set of possible vertex labelings ...
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