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 48
... necessary for the problem's solution . Ignorable problems . can be solved using a simple control structure that never backtracks . Such a control structure is easy to implement . Recoverable problems can be solved by a slightly more ...
... necessary for the problem's solution . Ignorable problems . can be solved using a simple control structure that never backtracks . Such a control structure is easy to implement . Recoverable problems can be solved by a slightly more ...
Página 128
... necessary . An alternative approach is to make the assumption that the only things that change are the things that must . By " must " here we mean that the change is either required explicitly by the axioms that describe the operator or ...
... necessary . An alternative approach is to make the assumption that the only things that change are the things that must . By " must " here we mean that the change is either required explicitly by the axioms that describe the operator or ...
Página 426
... necessary to produce the correct parse . Expand the grammar of Figure 15.6 as necessary to do this . • John wanted to go to the movie with Sally . • John wanted to go to the movie with Robert Redford . ⚫ I heard the story listening to ...
... necessary to produce the correct parse . Expand the grammar of Figure 15.6 as necessary to do this . • John wanted to go to the movie with Sally . • John wanted to go to the movie with Robert Redford . ⚫ I heard the story listening to ...
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