Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 90
Página 150
... 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 , which leaves only one way for proposition 2 to be true ...
... 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 , which leaves only one way for proposition 2 to be true ...
Página 205
... true . 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 ...
... true . 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 ...
Página 208
... true of only Joe and B is true of no one or those in which B is true of only Joe and A is true of no one . Thus , unlike the CWA , circumscription allows us to describe the logical relationship between A and B. 7.3 Implementation Issues ...
... true of only Joe and B is true of no one or those in which B is true of only Joe and A is true of no one . Thus , unlike the CWA , circumscription allows us to describe the logical relationship between A and B. 7.3 Implementation Issues ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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