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 29
Página 82
... reasonable thing to do . But in conversations , the fact that something is reasonable now does not mean that it will continue to be so after the conversation has proceeded for a while . So it is not a good idea simply to put possible ...
... reasonable thing to do . But in conversations , the fact that something is reasonable now does not mean that it will continue to be so after the conversation has proceeded for a while . So it is not a good idea simply to put possible ...
Página 137
... reasonable amount of time . A second thing it could do is use some sort of heuristic rules for deciding which answer is more likely and then try to prove that one first . If it fails to find a proof after some reasonable amount of ...
... reasonable amount of time . A second thing it could do is use some sort of heuristic rules for deciding which answer is more likely and then try to prove that one first . If it fails to find a proof after some reasonable amount of ...
Página 423
... reasonably be achieved by using language . See , for example , Cohen and Perrault [ 1979 ] . Fortunately , there is a ... reasonable , A must have a reason for wanting R done , A must have a reason for assuming that B can do R , A must ...
... reasonably be achieved by using language . See , for example , Cohen and Perrault [ 1979 ] . Fortunately , there is a ... reasonable , A must have a reason for wanting R done , A must have a reason for assuming that B can do R , A must ...
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