Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 80
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
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's