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 72
Página 56
... change ; new things get created . Nonmonotonic , partially commutative systems , on the other hand , are useful for problems in which changes occur but can be reversed and in which order of operations is not critical . This is usually ...
... change ; new things get created . Nonmonotonic , partially commutative systems , on the other hand , are useful for problems in which changes occur but can be reversed and in which order of operations is not critical . This is usually ...
Página 128
... changes that were made can simply be ignored ( as they could be if , for example , they were simply additions of new theorems ) , we are faced with the problem of backing up to some earlier node . But how do we know what changes in the ...
... changes that were made can simply be ignored ( as they could be if , for example , they were simply additions of new theorems ) , we are faced with the problem of backing up to some earlier node . But how do we know what changes in the ...
Página 337
... changes that were made to the global database as we passed through the node . Then , if we backtrack through that node , we can undo the changes . But the changes are described exactly in the ADD and DELETE lists of the operators that ...
... changes that were made to the global database as we passed through the node . Then , if we backtrack through that node , we can undo the changes . But the changes are described exactly in the ADD and DELETE lists of the operators that ...
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