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 16
Página 34
... branch of the tree until it yields a solution or until some prespecified depth has been reached and only then go back and explore other branches . This is called depth - first search . The requirement that a control strategy be ...
... branch of the tree until it yields a solution or until some prespecified depth has been reached and only then go back and explore other branches . This is called depth - first search . The requirement that a control strategy be ...
Página 78
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
Página 104
... branch - and - bound strategy is actually an example of the " try to go quickly on the average " strategy . There are at least four kinds of statements one could make about this kind of strategy : 6 How well it performs in the best case ...
... branch - and - bound strategy is actually an example of the " try to go quickly on the average " strategy . There are at least four kinds of statements one could make about this kind of strategy : 6 How well it performs in the best case ...
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