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 13
Página 3
... tion . Artificial intelligence ( AI ) is the study of how to make computers do things which , at the moment , people do better . This definition is , of course , somewhat ephemeral because of its reference to the current state of ...
... tion . Artificial intelligence ( AI ) is the study of how to make computers do things which , at the moment , people do better . This definition is , of course , somewhat ephemeral because of its reference to the current state of ...
Página 388
... tion is the branching factor . Is it greater going backward or forward ? Another important issue is the availability of good heuristics for evaluating progress . Can partial informa- tion be used to rule out paths early ? Sometimes ...
... tion is the branching factor . Is it greater going backward or forward ? Another important issue is the availability of good heuristics for evaluating progress . Can partial informa- tion be used to rule out paths early ? Sometimes ...
Página 418
... tion 10.2 . The story - understanding program SAM ( Cullingford , 1981 ] demonstrated the usefulness of such reasoning with scripts in natural language understanding . To understand a story , SAM first employed a parser that translated ...
... tion 10.2 . The story - understanding program SAM ( Cullingford , 1981 ] demonstrated the usefulness of such reasoning with scripts in natural language understanding . To understand a story , SAM first employed a parser that translated ...
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