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 79
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 300
... efficient terminological reasoning in the TBox and more general reasoning in the ABox . Terminological rea- soning involves answering questions about subsumption and inheritance , such as “ Can something be both a triangle and a ...
... efficient terminological reasoning in the TBox and more general reasoning in the ABox . Terminological rea- soning involves answering questions about subsumption and inheritance , such as “ Can something be both a triangle and a ...
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