Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 68
Página 67
... initial state . If it is also a goal state , then return it and quit . Otherwise , continue with the initial state as the current state . 2. Loop until a solution is found or until a complete iteration produces no change to current ...
... initial state . If it is also a goal state , then return it and quit . Otherwise , continue with the initial state as the current state . 2. Loop until a solution is found or until a complete iteration produces no change to current ...
Página 128
... initial state description at all . At each node , store an indication of the specific changes that should be made at this node . Whenever it is necessary to refer to the description of the current problem state , look at the initial ...
... initial state description at all . At each node , store an indication of the specific changes that should be made at this node . Whenever it is necessary to refer to the description of the current problem state , look at the initial ...
Página 350
... initial state . * CLEAR ( B ) is unachieved because although B is clear in the initial state , there ex- ists a step STACK ( A , B ) with postcondition ¬CLEAR ( B ) , and that step might precede the step with * CLEAR ( B ) as a ...
... initial state . * CLEAR ( B ) is unachieved because although B is clear in the initial state , there ex- ists a step STACK ( A , B ) with postcondition ¬CLEAR ( B ) , and that step might precede the step with * CLEAR ( B ) as a ...
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