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 83
Página 189
... called search control knowledge . It can take many forms : 1. Knowledge about which states are more preferable to others . 2. Knowledge about which rule to apply in a given situation . 3. Knowledge about the order in which to pursue ...
... called search control knowledge . It can take many forms : 1. Knowledge about which states are more preferable to others . 2. Knowledge about which rule to apply in a given situation . 3. Knowledge about the order in which to pursue ...
Página 386
... called a grammar , of the syntactic facts about the language • A procedure , called a parser , that compares the grammar against input sentences to produce parsed structures 15.2.1 Grammars and Parsers The most common way to represent ...
... called a grammar , of the syntactic facts about the language • A procedure , called a parser , that compares the grammar against input sentences to produce parsed structures 15.2.1 Grammars and Parsers The most common way to represent ...
Página 576
... called THEO - Agent [ Mitchell , 1990 ] . THEO - Agent contains two subsystems , a reactive engine and a general problem solver ( called THEO [ Mitchell et al . , 1989 ] ) . When the reactive subsystem fails to suggest a course of ...
... called THEO - Agent [ Mitchell , 1990 ] . THEO - Agent contains two subsystems , a reactive engine and a general problem solver ( called THEO [ Mitchell et al . , 1989 ] ) . When the reactive subsystem fails to suggest a course of ...
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