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 85
Página 270
... domain - independent slot attributes , slots may have domain- specific properties that support problem solving in a particular domain . Since these slots are not treated explicitly by the frame - system interpreter , they will be useful ...
... domain - independent slot attributes , slots may have domain- specific properties that support problem solving in a particular domain . Since these slots are not treated explicitly by the frame - system interpreter , they will be useful ...
Página 473
... domain theory is used to prune away all the unimportant aspects of the training example with respect to the goal concept . What is left is an explanation of why the training example is an instance of the goal concept . This explanation ...
... domain theory is used to prune away all the unimportant aspects of the training example with respect to the goal concept . What is left is an explanation of why the training example is an instance of the goal concept . This explanation ...
Página 547
... Domain Knowledge Expert systems are complex AI programs . Almost all the techniques that we described in Parts I and II have been exploited in at least one expert system . However , the most widely used way of representing domain ...
... Domain Knowledge Expert systems are complex AI programs . Almost all the techniques that we described in Parts I and II have been exploited in at least one expert system . However , the most widely used way of representing domain ...
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