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 77
... depth - first search procedures . Such procedures are often easy to implement and they may happen upon a good solu- tion very quickly . But they also often spend a lot of time exploring unfruitful paths . The ... Breadth-First Search.
... depth - first search procedures . Such procedures are often easy to implement and they may happen upon a good solu- tion very quickly . But they also often spend a lot of time exploring unfruitful paths . The ... Breadth-First Search.
Página 78
Elaine Rich. 3.6.4 Best - First Search : OR Graphs Best - first search is a way of combining the advantages of both depth - first and breadth - first search into a single method . At each step of the best - first search process , we ...
Elaine Rich. 3.6.4 Best - First Search : OR Graphs Best - first search is a way of combining the advantages of both depth - first and breadth - first search into a single method . At each step of the best - first search process , we ...
Página 107
... depth - first search be better than a breadth - first one ? 5. When would best - first search be worse than simple breadth - first search ? 6. Suppose that the first step of the operation of SEC . 3.8 SUMMARY 107 9 Exercises.
... depth - first search be better than a breadth - first one ? 5. When would best - first search be worse than simple breadth - first search ? 6. Suppose that the first step of the operation of SEC . 3.8 SUMMARY 107 9 Exercises.
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 branching factor breadth-first search Chapter chess clauses CLEAR(A complete Computer concept conceptual dependency consider constraints contains database described discussed domain example expert systems exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP machine Marcus match methods minimax move MYCIN natural language 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 variety