Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 54
Página 146
Elaine Rich. 3. Standardize variables so that each quantifier binds a unique variable . Since variables are just dummy names , this process cannot affect the truth value of the wff . For example , the formula Vx : P ( x ) VVx : Q ( x ) ...
Elaine Rich. 3. Standardize variables so that each quantifier binds a unique variable . Since variables are just dummy names , this process cannot affect the truth value of the wff . For example , the formula Vx : P ( x ) VVx : Q ( x ) ...
Página 147
... variables in the set of clauses generated in step 8. By this we mean rename the variables so that no two clauses make reference to the same variable . In making this transformation , we rely on the fact that ( x : P ( x ) Ʌ Q ( x ) ...
... variables in the set of clauses generated in step 8. By this we mean rename the variables so that no two clauses make reference to the same variable . In making this transformation , we rely on the fact that ( x : P ( x ) Ʌ Q ( x ) ...
Página 532
... variables can be linked to one another via equations . The simplest equation states that variable x increases as variable y increases . This gives us an abstract representation of the actual function relating x and y ( it may be linear ...
... variables can be linked to one another via equations . The simplest equation states that variable x increases as variable y increases . This gives us an abstract representation of the actual function relating x and y ( it may be linear ...
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