Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 47
Página 39
... Depth - First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success . 2. Otherwise , do the following until success or failure is signaled : ( a ) Generate a successor , E , of ...
... Depth - First Search Tree Algorithm : Depth - First Search 1. If the initial state is a goal state , quit and return success . 2. Otherwise , do the following until success or failure is signaled : ( a ) Generate a successor , E , of ...
Página 73
... first search and depth - first search ( of several varieties ) . In this section , we discuss a new method , best - first search , which is a way of combining the advantages of both depth - first and breadth - first search into a single ...
... first search and depth - first search ( of several varieties ) . In this section , we discuss a new method , best - first search , which is a way of combining the advantages of both depth - first and breadth - first search into a single ...
Página 211
... Depth - First Search 7.5.1 Dependency - Directed Backtracking If we take a depth - first approach to nonmonotonic reasoning , then the following sce- nario is likely to occur often : We need to know a fact , F , which cannot be derived ...
... Depth - First Search 7.5.1 Dependency - Directed Backtracking If we take a depth - first approach to nonmonotonic reasoning , then the following sce- nario is likely to occur often : We need to know a fact , F , which cannot be derived ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's