Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 44
Página 148
... clauses , called the parent clauses , are compared ( resolved ) , yielding a new clause that has been inferred from them . The new clause represents ways that the two parent clauses interact with each other . Suppose that there are two ...
... clauses , called the parent clauses , are compared ( resolved ) , yielding a new clause that has been inferred from them . The new clause represents ways that the two parent clauses interact with each other . Suppose that there are two ...
Página 149
... clause form . Add it to the set of clauses obtained in step 1 . 3. Repeat until either a contradiction is found or no progress can be made : ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them together . The ...
... clause form . Add it to the set of clauses obtained in step 1 . 3. Repeat until either a contradiction is found or no progress can be made : ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them together . The ...
Página 154
... clauses obtained in 1 . 3. Repeat until either a contradiction is found , no progress can be made , or a prede- termined amount of effort has been expended . ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them ...
... clauses obtained in 1 . 3. Repeat until either a contradiction is found , no progress can be made , or a prede- termined amount of effort has been expended . ( a ) Select two clauses . Call these the parent clauses . ( b ) Resolve them ...
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