Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 69
Página 329
... complete problem state , and each operator describes a way of changing the total state description . For simple problems , such as , say , the 8 - puzzle , manipulating the complete state description at one time is easy and reasonable ...
... complete problem state , and each operator describes a way of changing the total state description . For simple problems , such as , say , the 8 - puzzle , manipulating the complete state description at one time is easy and reasonable ...
Página 347
... complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the solution to a previous subproblem . Most problems require ...
... complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the solution to a previous subproblem . Most problems require ...
Página 545
... complete plans for solving problems in the domain of cooking . CHEF's case library is augmented with a plan - modification library indexed by plan types and change types . CHEF first looks at the retrieved plan and sees if it satisfies ...
... complete plans for solving problems in the domain of cooking . CHEF's case library is augmented with a plan - modification library indexed by plan types and change types . CHEF first looks at the retrieved plan and sees if it satisfies ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain fact frame function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space