Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 46
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 531
... Variables - In traditional physics , real - valued variables are used to represent fea- tures of objects , such as position , velocity , angle , and temperature . Qualitative physics retains this notion , but restricts each variable to ...
... Variables - In traditional physics , real - valued variables are used to represent fea- tures of objects , such as position , velocity , angle , and temperature . Qualitative physics retains this notion , but restricts each variable to ...
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
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