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 12
Página 30
... attack . The legal moves provide the way of getting from the initial state to a goal state . They can be described easily as a set of rules consisting of two parts : a left side that serves as a pattern to be matched against the current ...
... attack . The legal moves provide the way of getting from the initial state to a goal state . They can be described easily as a set of rules consisting of two parts : a left side that serves as a pattern to be matched against the current ...
Página 426
... attack the problem of machine translation , by which we understand text written in one language and then generate it in another language . See Slocum [ 1988 ] , Nirenburg [ 1987 ] , Lehrberger and Bourbeau [ 1988 ] , and Nagao [ 1989 ] ...
... attack the problem of machine translation , by which we understand text written in one language and then generate it in another language . See Slocum [ 1988 ] , Nirenburg [ 1987 ] , Lehrberger and Bourbeau [ 1988 ] , and Nagao [ 1989 ] ...
Página 471
... attacks both the black king and the black queen . Black must move the king , thereby leaving the queen open to capture ... attack is important while the precise position and type of the attacking piece is not . Much of the recent work in ...
... attacks both the black king and the black queen . Black must move the king , thereby leaving the queen open to capture ... attack is important while the precise position and type of the attacking piece is not . Much of the recent work in ...
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