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 96
Página 182
... rules , then the rules will not be reversible . Some production languages allow only reversible rules ; others do not . When irreversible rules are used , then a commitment to the direction of the search must be made at the time the rules ...
... rules , then the rules will not be reversible . Some production languages allow only reversible rules ; others do not . When irreversible rules are used , then a commitment to the direction of the search must be made at the time the rules ...
Página 184
... rule- based systems , we need to compute the whole set of rules that match the current state description . Backward - chaining systems usually use depth - first backtracking to select individual rules , but forward - chaining systems ...
... rule- based systems , we need to compute the whole set of rules that match the current state description . Backward - chaining systems usually use depth - first backtracking to select individual rules , but forward - chaining systems ...
Página 187
... rule would perform . Preferences Based on Rules There are two common ways of assigning a preference based on the rules themselves . The first , and simplest , is to consider the rules to have been specified in a particular order , such ...
... rule would perform . Preferences Based on Rules There are two common ways of assigning a preference based on the rules themselves . The first , and simplest , is to consider the rules to have been specified in a particular order , such ...
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