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 77
Página 359
Elaine Rich, Kevin Knight. Chapter 14 Understanding 14.1 What Is Understanding ? To understand something is to transform it from one representation into another , where this second representation has ... Understanding What Is Understanding?
Elaine Rich, Kevin Knight. Chapter 14 Understanding 14.1 What Is Understanding ? To understand something is to transform it from one representation into another , where this second representation has ... Understanding What Is Understanding?
Página 367
... Understanding is the process of interpreting an input and assigning it meaning . Unfortu- nately , in many understanding situations the input to which ... UNDERSTANDING AS CONSTRAINT SATISFACTION 367 Understanding as Constraint Satisfaction.
... Understanding is the process of interpreting an input and assigning it meaning . Unfortu- nately , in many understanding situations the input to which ... UNDERSTANDING AS CONSTRAINT SATISFACTION 367 Understanding as Constraint Satisfaction.
Página 418
... 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 the English sentences ...
... 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 the English sentences ...
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