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 89
Página 57
... important to make correct decisions the first time , although if the universe is predictable , planning can be used to make that less important . 2.5 Issues in the Design of Search Programs Every search process can be viewed as a ...
... important to make correct decisions the first time , although if the universe is predictable , planning can be used to make that less important . 2.5 Issues in the Design of Search Programs Every search process can be viewed as a ...
Página 125
... important problem with this method is that if the problem description contains any even slightly extraneous concepts ... important and which are not . But the relative importance of clues can change dramatically from one situation to ...
... important problem with this method is that if the problem description contains any even slightly extraneous concepts ... important and which are not . But the relative importance of clues can change dramatically from one situation to ...
Página 544
... important features are not always the most obvious ones . Here is an example from Schank [ 1977 ] , called the “ steak and haircut " story : X described how his wife would never cook his steak as rare as he liked it . When X told this ...
... important features are not always the most obvious ones . Here is an example from Schank [ 1977 ] , called the “ steak and haircut " story : X described how his wife would never cook his steak as rare as he liked it . When X told this ...
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