Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
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 207
... true should be assumed to be false , it does not capture all of it . It has two essential limitations : • It operates on individual predicates without considering the interactions among predicates that are defined in the knowledge base ...
... true should be assumed to be false , it does not capture all of it . It has two essential limitations : • It operates on individual predicates without considering the interactions among predicates that are defined in the knowledge base ...
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
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