Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 39
Página 148
... contradiction exists , then eventually it will be found . Of course , if no contradiction exists , it is possible that the procedure will never terminate , although as we will see , there are often ways of detecting that no ...
... contradiction exists , then eventually it will be found . Of course , if no contradiction exists , it is possible that the procedure will never terminate , although as we will see , there are often ways of detecting that no ...
Página 218
... contradictions . In a TMS , a contradiction node does not represent a logical contradiction but rather a state of the database explicitly declared to be undesirable . ( In the next section , we describe a slightly different kind of TMS ...
... contradictions . In a TMS , a contradiction node does not represent a logical contradiction but rather a state of the database explicitly declared to be undesirable . ( In the next section , we describe a slightly different kind of TMS ...
Página 221
... contradiction resolution ) ⚫ choosing among alternative ways of resolving a contradiction ⚫ detecting contradictions All of these operations must be performed by the problem - solving program that is using the JTMS . In the next ...
... contradiction resolution ) ⚫ choosing among alternative ways of resolving a contradiction ⚫ detecting contradictions All of these operations must be performed by the problem - solving program that is using the JTMS . In the next ...
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