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 83
Página 8
... usually call something without this property " data " rather than knowledge . ⚫ It can be understood by people who must provide it . Although for many programs , the bulk of the data can be acquired automatically ( for example , by ...
... usually call something without this property " data " rather than knowledge . ⚫ It can be understood by people who must provide it . Although for many programs , the bulk of the data can be acquired automatically ( for example , by ...
Página 299
... usually possible to separate the two facets cleanly . However , as we have seen in the last few chapters , knowledge representation systems can play the role of support systems that underly specific problem - solving programs . The ...
... usually possible to separate the two facets cleanly . However , as we have seen in the last few chapters , knowledge representation systems can play the role of support systems that underly specific problem - solving programs . The ...
Página 549
... usually written primarily as rule - based systems , forward chaining , backward chaining , or some combination of the two , is usually used . For example , MYCIN used backward chaining to discover what organisms were present ; then it ...
... usually written primarily as rule - based systems , forward chaining , backward chaining , or some combination of the two , is usually used . For example , MYCIN used backward chaining to discover what organisms were present ; then it ...
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