Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 29
Página 386
... 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 grammars ...
... 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 grammars ...
Página 387
... grammar . Figure 15.2 contained another example of a parse tree , although some additions to this grammar would be required to produce it . Notice that every node of the parse tree corresponds either to an input word or to a nonterminal ...
... grammar . Figure 15.2 contained another example of a parse tree , although some additions to this grammar would be required to produce it . Notice that every node of the parse tree corresponds either to an input word or to a nonterminal ...
Página 401
... grammar is shown in Figure 15.10 . This grammar defines part of a simple interface to an operating system . Shown in braces under each rule is the semantic action that is taken when the rule is applied . The term " value " is used to ...
... grammar is shown in Figure 15.10 . This grammar defines part of a simple interface to an operating system . Shown in braces under each rule is the semantic action that is taken when the rule is applied . The term " value " is used to ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's