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 52
Página 94
... analysis allows us to do that . The means - ends analysis process centers around the detection of differences between the current state and the goal state . Once such a difference is isolated , an operator that can reduce the difference ...
... analysis allows us to do that . The means - ends analysis process centers around the detection of differences between the current state and the goal state . Once such a difference is isolated , an operator that can reduce the difference ...
Página 397
... analysis , it has also been used as a basis for semantic interpretation . In fact , there are arguments for using it as a uniform representation for all phases of natural language understanding . There are ... ANALYSIS 397 Semantic Analysis.
... analysis , it has also been used as a basis for semantic interpretation . In fact , there are arguments for using it as a uniform representation for all phases of natural language understanding . There are ... ANALYSIS 397 Semantic Analysis.
Página 602
... Analysis in the Behavioral Sciences . PhD thesis , Harvard University , Cambridge , MA . Whitehead , A. N. and B. Russell . 1950. Principia Mathematica , 2nd ed . Cambridge : Cambridge University Press . Wilcox , B. 1988. Computer Go ...
... Analysis in the Behavioral Sciences . PhD thesis , Harvard University , Cambridge , MA . Whitehead , A. N. and B. Russell . 1950. Principia Mathematica , 2nd ed . Cambridge : Cambridge University Press . Wilcox , B. 1988. Computer Go ...
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