Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 5
Página 15
... string . The current question also stored as a character string . To answer a question , do the following : 1. Compare each element of Question Patterns against the Question and use all those that match successfully to generate a set of ...
... string . The current question also stored as a character string . To answer a question , do the following : 1. Compare each element of Question Patterns against the Question and use all those that match successfully to generate a set of ...
Página 386
... string . Symbols that are further expanded by rules are called nonterminal symbols . Symbols that correspond directly to strings that must be found in an input sentence are called terminal symbols . Grammar formalisms such as this one ...
... string . Symbols that are further expanded by rules are called nonterminal symbols . Symbols that correspond directly to strings that must be found in an input sentence are called terminal symbols . Grammar formalisms such as this one ...
Página 543
... string of deductions that led from the input data to the conclusion . With human experts , however , we often observe a different type of explanation . An expert encountering a new problem is usually reminded of similar cases seen in ...
... string of deductions that led from the input data to the conclusion . With human experts , however , we often observe a different type of explanation . An expert encountering a new problem is usually reminded of similar cases seen in ...
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