Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 200
... corresponding to B is shown at the lower right of the large circle . Now suppose we add some new wff's ( representing new information ) to A. We represent A with these additions as the box C. A difficulty may arise , however , if the ...
... corresponding to B is shown at the lower right of the large circle . Now suppose we add some new wff's ( representing new information ) to A. We represent A with these additions as the box C. A difficulty may arise , however , if the ...
Página 222
... correspond to the components of a justification . In particular , given a justification of the form ΑΓΛΑΣ Λ Ʌ An → C 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 ΑΓΛΑΣ Λ Ʌ An → C assign as a context for the node corresponding to C the intersection of the contexts corresponding to the nodes A1 ...
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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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