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 18
Página 19
... structure . Data Structures WorldModel EnglishKnow InputText Integrated Text InputQuestion A structured representation of background world knowledge . This structure contains knowledge about objects , actions , and situations that are ...
... structure . Data Structures WorldModel EnglishKnow InputText Integrated Text InputQuestion A structured representation of background world knowledge . This structure contains knowledge about objects , actions , and situations that are ...
Página 439
... data structure through which the knowledge sources communicate with each other • A control system , which determines the order in which knowledge sources will operate on the entries on the blackboard To see how these pieces work ...
... data structure through which the knowledge sources communicate with each other • A control system , which determines the order in which knowledge sources will operate on the entries on the blackboard To see how these pieces work ...
Página 544
... data structure for the case itself is also important . A case is usually stored as a monolithic structure , although in some variations , cases can be stored piecemeal . The former strategy is efficient when it is possible to obtain ...
... data structure for the case itself is also important . A case is usually stored as a monolithic structure , although in some variations , cases can be stored piecemeal . The former strategy is efficient when it is possible to obtain ...
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