Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 184
... efficient to consider the many - many match problem , in which many rules are matched against many elements in the state description simultaneously . One efficient many - many match algorithm is RETE , which gains efficiency from three ...
... efficient to consider the many - many match problem , in which many rules are matched against many elements in the state description simultaneously . One efficient many - many match algorithm is RETE , which gains efficiency from three ...
Página 291
... efficient inference templates . There is a translation program for automatically converting an EL statement into an efficient HL representation . The EL provides a clean , simple functional interface to CYC so that users and computer ...
... efficient inference templates . There is a translation program for automatically converting an EL statement into an efficient HL representation . The EL provides a clean , simple functional interface to CYC so that users and computer ...
Página 354
... efficient plan construction - if anything , most domains seem to require operators that are much more complex than the operators used by TWEAK . For example , it is natural to express many preconditions using quantifiers and embedded ...
... efficient plan construction - if anything , most domains seem to require operators that are much more complex than the operators used by TWEAK . For example , it is natural to express many preconditions using quantifiers and embedded ...
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