Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 38
Página 298
... syntactic . Their rules of inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters ...
... syntactic . Their rules of inference are strictly syntactic procedures that operate on well - formed formulas ( wff ) regardless of what those formulas represent . Production rule systems are primarily syntactic also . The interpreters ...
Página 381
... syntactic category . Syntactic Analysis Syntactic analysis must exploit the results of morphological analysis to build a structural description of the sentence . The goal of this process , called parsing , is to convert the flat list of ...
... syntactic category . Syntactic Analysis Syntactic analysis must exploit the results of morphological analysis to build a structural description of the sentence . The goal of this process , called parsing , is to convert the flat list of ...
Página 414
... syntactic and the semantic processors . Two extreme positions are : • Every time a syntactic constituent is formed , apply semantic interpretation to it immediately . • Wait until the entire sentence has been parsed , and then interpret ...
... syntactic and the semantic processors . Two extreme positions are : • Every time a syntactic constituent is formed , apply semantic interpretation to it immediately . • Wait until the entire sentence has been parsed , and then interpret ...
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