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 87
Página 222
... correspond to the components of a justification . In particular , given a justification of the form А1ЛА2Л ... A An → С assign as a context for the node corresponding to C the intersection of the contexts corresponding to the nodes A1 ...
... correspond to the components of a justification . In particular , given a justification of the form А1ЛА2Л ... A An → С assign as a context for the node corresponding to C the intersection of the contexts corresponding to the nodes A1 ...
Página 371
... corresponding to the faces of vertex A. Imagine viewing this figure from each of the remaining seven octants and recording the configuration and the labeling of vertex A. Figure 14.16 ( a ) shows the results of this . When we take those ...
... corresponding to the faces of vertex A. Imagine viewing this figure from each of the remaining seven octants and recording the configuration and the labeling of vertex A. Figure 14.16 ( a ) shows the results of this . When we take those ...
Página 410
... corresponding step in semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form a larger semantic unit . The necessary ...
... corresponding step in semantic interpretation . Each time syntactic constituents are combined to form a larger syntactic unit , their corresponding semantic interpretations can be combined to form a larger semantic unit . The necessary ...
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