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 14
Página 63
... limited effectiveness of these weak methods to solve hard problems by themselves has been an important result that emerged from the last three decades of AI research , these techniques continue to provide the framework into which domain ...
... limited effectiveness of these weak methods to solve hard problems by themselves has been an important result that emerged from the last three decades of AI research , these techniques continue to provide the framework into which domain ...
Página 425
... limited set . We thus rule out Bill's mixer as a component of the cake in the sentence , " John made a huge wedding cake with Bill's mixer . " Discourse processing contributes a further set of constraints that arise from the structure ...
... limited set . We thus rule out Bill's mixer as a component of the cake in the sentence , " John made a huge wedding cake with Bill's mixer . " Discourse processing contributes a further set of constraints that arise from the structure ...
Página 561
... limited search horizon . Also , having incomplete information about the world can further limit that search horizon . For example , consider the task of navigating from one room to another in an unfamiliar building . The search horizon ...
... limited search horizon . Also , having incomplete information about the world can further limit that search horizon . For example , consider the task of navigating from one room to another in an unfamiliar building . The search horizon ...
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