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 83
Página 55
... kinds of problems for which they are suitable , we will be able to bring to each new problem much of what we have ... kinds of problems and kinds of production systems since all problems can be solved by all kinds of systems . But in a ...
... kinds of problems for which they are suitable , we will be able to bring to each new problem much of what we have ... kinds of problems and kinds of production systems since all problems can be solved by all kinds of systems . But in a ...
Página 94
... kinds of constraints . The first kind are simple ; they just list possible values for a single object . The second kind are more complex ; they describe relationships between or among objects . Both kinds of constraints play the same ...
... kinds of constraints . The first kind are simple ; they just list possible values for a single object . The second kind are more complex ; they describe relationships between or among objects . Both kinds of constraints play the same ...
Página 302
... kinds of problem - solving tasks , it is necessary to model the behavior of some object or system . To diagnose faults in physical devices , such as electronic circuits or electric motors , it is necessary to model the behavior of both ...
... kinds of problem - solving tasks , it is necessary to model the behavior of some object or system . To diagnose faults in physical devices , such as electronic circuits or electric motors , it is necessary to model the behavior of both ...
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