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 89
Página 22
... produce programs that do the intelligent things that people do ? " Are we trying to produce programs that do the tasks the same way people do ? Or , are we attempting to produce programs that simply do the tasks in whatever way appears ...
... produce programs that do the intelligent things that people do ? " Are we trying to produce programs that do the tasks the same way people do ? Or , are we attempting to produce programs that simply do the tasks in whatever way appears ...
Página 149
... producing ¬R , which is already in clause form . Then we begin selecting pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent ...
... producing ¬R , which is already in clause form . Then we begin selecting pairs of clauses to resolve together . Although any pair of clauses can be resolved , only those pairs that contain complementary literals will produce a resolvent ...
Página 162
... produces a contradiction . What does it mean for that statement to produce a contradic- tion ? Either it conflicts with a statement of the form Vt : died ( Marcus , t ) where t is a variable , in which case we can either answer the ...
... produces a contradiction . What does it mean for that statement to produce a contradic- tion ? Either it conflicts with a statement of the form Vt : died ( Marcus , t ) where t is a variable , in which case we can either answer 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