Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 79
Página 6
... called symbols , which are physical patterns that can occur as components of another type of entity called an expression ( or symbol structure ) . Thus , a symbol structure is composed of a number of instances ( or tokens ) of symbols ...
... called symbols , which are physical patterns that can occur as components of another type of entity called an expression ( or symbol structure ) . Thus , a symbol structure is composed of a number of instances ( or tokens ) of symbols ...
Página 117
... called backward rules . Such rules have also been called if - needed rules . • Rules that describe actions that should be taken if a value ever becomes known . These rules are called forward rules , or sometimes if - added rules . We ...
... called backward rules . Such rules have also been called if - needed rules . • Rules that describe actions that should be taken if a value ever becomes known . These rules are called forward rules , or sometimes if - added rules . We ...
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 ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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