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 86
Página 243
... defined not just for elements of but for all subsets of it ( including singleton subsets , which correspond to ... defined m , we can now define Bel ( p ) for a set p as the sum of the values of m for p and for all of its subsets . Thus ...
... defined not just for elements of but for all subsets of it ( including singleton subsets , which correspond to ... defined m , we can now define Bel ( p ) for a set p as the sum of the values of m for p and for all of its subsets . Thus ...
Página 268
... definition , and default ) to be defined . implicitly by how the slot is used in the definitions of the classes in its domain . We describe the domain implicitly to be the class where the slot appears . We describe the range and any ...
... definition , and default ) to be defined . implicitly by how the slot is used in the definitions of the classes in its domain . We describe the domain implicitly to be the class where the slot appears . We describe the range and any ...
Página 274
... defines only a partial ordering . Some classes are incom- mensurate with each other under it . We can now define the result ... defined inferential distance is that as long as Ostrich is a subclass of Bird , it will be closer to all its ...
... defines only a partial ordering . Some classes are incom- mensurate with each other under it . We can now define the result ... defined inferential distance is that as long as Ostrich is a subclass of Bird , it will be closer to all its ...
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