Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 79
Página 6
There are now thousands of programs called expert systems in day - to - day
operation throughout all areas of industry and government . Each of these
systems attempts to solve part , or perhaps all , of a practical , significant problem
that ...
There are now thousands of programs called expert systems in day - to - day
operation throughout all areas of industry and government . Each of these
systems attempts to solve part , or perhaps all , of a practical , significant problem
that ...
Página 117
These rules are called backward rules . Such rules have also been called if -
needed rules . • Rules that describe actions that should be taken if a value ever
becomes known . These rules are called forward rules , or sometimes if - added
rules ...
These rules are called backward rules . Such rules have also been called if -
needed rules . • Rules that describe actions that should be taken if a value ever
becomes known . These rules are called forward rules , or sometimes if - added
rules ...
Página 386
Although there are many ways to produce a parse , almost all the systems that
are actually used have two main components : • A declarative representation ,
called a grammar , of the syntactic facts about the language • A procedure , called
a ...
Although there are many ways to produce a parse , almost all the systems that
are actually used have two main components : • A declarative representation ,
called a grammar , of the syntactic facts about the language • A procedure , called
a ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter choose clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights