Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 89
Página 14
... question may be very hard . Usually , question - answering programs define what it means to be an answer by the procedure that is used to compute the answer . Then their authors appeal to other people to agree that the answers found by ...
... question may be very hard . Usually , question - answering programs define what it means to be an answer by the procedure that is used to compute the answer . Then their authors appeal to other people to agree that the answers found by ...
Página 15
... question , then the text pattern " x y z " is matched against the input text and the value of z is given as the answer to the question . The input text stored simply as a long character string . The current question also stored as a ...
... question , then the text pattern " x y z " is matched against the input text and the value of z is given as the answer to the question . The input text stored simply as a long character string . The current question also stored as a ...
Página 552
... question that the user asks is a " WHY " question , which is assumed to mean " Why do you need to know that ? " Particularly for clinical tests that are either expensive or dangerous , it is important for the doctor to be convinced that ...
... question that the user asks is a " WHY " question , which is assumed to mean " Why do you need to know that ? " Particularly for clinical tests that are either expensive or dangerous , it is important for the doctor to be convinced that ...
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