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 77
Página 138
... instance ( Marcus , man ) 2 . instance ( Marcus . Pompeian ) 3. Vx : instance ( x , Pompeian ) → instance ( x , Roman ) 4 . 5 . instance ( Caesar , ruler ) Vx : instance ( x , Roman ) → loyalto ( x , Caesar ) \ hate ( x , Caesar ) 1 ...
... instance ( Marcus , man ) 2 . instance ( Marcus . Pompeian ) 3. Vx : instance ( x , Pompeian ) → instance ( x , Roman ) 4 . 5 . instance ( Caesar , ruler ) Vx : instance ( x , Roman ) → loyalto ( x , Caesar ) \ hate ( x , Caesar ) 1 ...
Página 260
... instance ( instance ) of a class of sets , from which it inherits its set - level properties . To make this distinction clear , it is useful to distinguish between regular classes , whose elements are individual entities , and ...
... instance ( instance ) of a class of sets , from which it inherits its set - level properties . To make this distinction clear , it is useful to distinguish between regular classes , whose elements are individual entities , and ...
Página 292
... instance of the template , storing justifications of facts that are deduced ( and retracting those facts when the justifications disappear ) , and applying the inference mechanism efficiently . As with production systems , we can build ...
... instance of the template , storing justifications of facts that are deduced ( and retracting those facts when the justifications disappear ) , and applying the inference mechanism efficiently . As with production systems , we can build ...
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