Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 87
Página 22
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 easiest ? There have been Al projects motivated by each of these ...
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 easiest ? There have been Al projects motivated by each of these ...
Página 149
produces a contradiction . But that is highly inefficient . ... In propositional logic ,
the procedure for producing a proof by resolution of proposition P with respect to
a set of axioms F is the following . Algorithm : Propositional Resolution 1 .
Convert ...
produces a contradiction . But that is highly inefficient . ... In propositional logic ,
the procedure for producing a proof by resolution of proposition P with respect to
a set of axioms F is the following . Algorithm : Propositional Resolution 1 .
Convert ...
Página 162
To do so using resolution , we attempt to show that 3t : died ( Marcus , 1 )
produces a contradiction . What does it mean for that statement to produce a
contradiction ? Either it conflicts with a statement of the form Vt : died ( Marcus , 1
) where t is ...
To do so using resolution , we attempt to show that 3t : died ( Marcus , 1 )
produces a contradiction . What does it mean for that statement to produce a
contradiction ? Either it conflicts with a statement of the form Vt : died ( Marcus , 1
) where t is ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights