Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 86
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 , 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 text patterns . 2. Pass each of these patterns through a substitution process ...
... 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 text patterns . 2. Pass each of these patterns through a substitution process ...
Página 162
... question , it must first be true that Marcus died . Thus it must be the case that 3t : died ( Marcus , t ) A reasonable first step then might be to try to prove this . To do so using resolution , we attempt to show that -3t : died ...
... question , it must first be true that Marcus died . Thus it must be the case that 3t : died ( Marcus , t ) A reasonable first step then might be to try to prove this . To do so using resolution , we attempt to show that -3t : died ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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