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 44
Página 52
... final state is ( 2 , 0 ) . For this kind of problem , what we really must report is not the final state but the path that we found to that state . Thus a statement of a solution to this problem must be a sequence of operations ...
... final state is ( 2 , 0 ) . For this kind of problem , what we really must report is not the final state but the path that we found to that state . Thus a statement of a solution to this problem must be a sequence of operations ...
Página 108
... final facts are actually generated . If either the program's operation or one of the representation mappings is not faithful to the problem that is being modeled , then the final facts will probably not be the desired ones . The key ...
... final facts are actually generated . If either the program's operation or one of the representation mappings is not faithful to the problem that is being modeled , then the final facts will probably not be the desired ones . The key ...
Página 384
... final meaning shown in Figure 15.5 . The final step in pragmatic processing is to translate , when necessary , from the knowledge - based representation to a command to be executed by the system . In this case , this step is necessary ...
... final meaning shown in Figure 15.5 . The final step in pragmatic processing is to translate , when necessary , from the knowledge - based representation to a command to be executed by the system . In this case , this step is necessary ...
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