Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 87
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
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's