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 6
Página 411
... routine will reject any interpretation that does not satisfy all these constraints . This compositional approach to defining semantic interpretation has proved to be a very powerful idea . ( See , for example , the Absity system ...
... routine will reject any interpretation that does not satisfy all these constraints . This compositional approach to defining semantic interpretation has proved to be a very powerful idea . ( See , for example , the Absity system ...
Página 462
... routine will note that the only difference between the current definition and the near miss is in the does - not - marry link between nodes B and D. But since this is a near miss , we do not want to broaden the definition to include it ...
... routine will note that the only difference between the current definition and the near miss is in the does - not - marry link between nodes B and D. But since this is a near miss , we do not want to broaden the definition to include it ...
Página 481
... routine in Pascal , and then you are asked to recode the routine in LISP . A line- by - line translation is not appropriate , but you will reuse the major structural and control decisions you made when you constructed the Pascal program ...
... routine in Pascal , and then you are asked to recode the routine in LISP . A line- by - line translation is not appropriate , but you will reuse the major structural and control decisions you made when you constructed the Pascal program ...
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