Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 90
Página 150
8 : Resolution in Propositional Logic that , the only way for proposition 2 to be
true is for one of two things to be true : P or - Q . That is what the first resolvent
clause says . But proposition 1 says that P is true . which means that - P cannot
be true ...
8 : Resolution in Propositional Logic that , the only way for proposition 2 to be
true is for one of two things to be true : P or - Q . That is what the first resolvent
clause says . But proposition 1 says that P is true . which means that - P cannot
be true ...
Página 205
In this section we describe methods for saying a very specific and highly useful
class of things that are generally true . These methods are based on some variant
of the idea of a minimal model . Recall from the beginning of this section that a ...
In this section we describe methods for saying a very specific and highly useful
class of things that are generally true . These methods are based on some variant
of the idea of a minimal model . Recall from the beginning of this section that a ...
Página 208
A ( Joe ) V B ( Joe ) If we circumscribe only A , then this assertion describes
exactly those models in which A is true of no one and B is true of at least Joe .
Similarly , if we circumscribe only B , then we will accept exactly those models in
which B ...
A ( Joe ) V B ( Joe ) If we circumscribe only A , then this assertion describes
exactly those models in which A is true of no one and B is true of at least Joe .
Similarly , if we circumscribe only B , then we will accept exactly those models in
which B ...
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