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 83
Página 464
... space , and can be depicted as in Figure 17.11 . At the top of the concept space is the null description , consisting only of variables , and at the bottom are all the possible training instances , which contain no variables . Before we ...
... space , and can be depicted as in Figure 17.11 . At the top of the concept space is the null description , consisting only of variables , and at the bottom are all the possible training instances , which contain no variables . Before we ...
Página 536
... space [ Kautz , 1985 ] . The basic idea is to define relations over spaces . The first relation is INSIDE ( x , y , g ) , where x and y are spaces occupied by particular objects and g is the level of granularity at which those objects ...
... space [ Kautz , 1985 ] . The basic idea is to define relations over spaces . The first relation is INSIDE ( x , y , g ) , where x and y are spaces occupied by particular objects and g is the level of granularity at which those objects ...
Página 538
... space occupied by water . Containers play an important role in the world of liquids . Since we do not want to refer ... space s can hold . The space is FULL when the AMOUNT equals the CAPACITY . CAPACITY ( s ) ≥ AMOUNT ( l , s ) > none ...
... space occupied by water . Containers play an important role in the world of liquids . Since we do not want to refer ... space s can hold . The space is FULL when the AMOUNT equals the CAPACITY . CAPACITY ( s ) ≥ AMOUNT ( l , s ) > none ...
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