Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 63
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 385
... complete system , all of these processes are necessary in some form . For example , it may have seemed that we could have skipped the knowledge - based representation of the meaning of the sentence since the final output of the ...
... complete system , all of these processes are necessary in some form . For example , it may have seemed that we could have skipped the knowledge - based representation of the meaning of the sentence since the final output of the ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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