Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 74
Página 214
... mechanism for propagating the result of retracting an assumption . This mechanism must cause all of the justifications that depended , however indirectly , on the retracted assumption to become invalid . In the next two sections , we ...
... mechanism for propagating the result of retracting an assumption . This mechanism must cause all of the justifications that depended , however indirectly , on the retracted assumption to become invalid . In the next two sections , we ...
Página 291
... mechanisms ( including inheritance and transfers - through ) , each with its own truth maintenance fa- cility . The constraint language allows for the expression of facts that are too complex for any of these mechanisms to handle . The ...
... mechanisms ( including inheritance and transfers - through ) , each with its own truth maintenance fa- cility . The constraint language allows for the expression of facts that are too complex for any of these mechanisms to handle . The ...
Página 335
... mechanism that does not require a large number of explicit frame axioms . One such mechanism is that used by the early robot problem - solving system STRIPS [ Fikes and Nilsson , 1971 ] and its descendants . In this approach , each ...
... mechanism that does not require a large number of explicit frame axioms . One such mechanism is that used by the early robot problem - solving system STRIPS [ Fikes and Nilsson , 1971 ] and its descendants . In this approach , each ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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