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 93
Página 198
... reasoning has a significant impact on a knowledge base . Non- monotonic reasoning systems derive their name from the fact that because of inferences that depend on lack of knowledge , knowledge bases may not grow monotonically as new ...
... reasoning has a significant impact on a knowledge base . Non- monotonic reasoning systems derive their name from the fact that because of inferences that depend on lack of knowledge , knowledge bases may not grow monotonically as new ...
Página 209
... reasoning systems that support this kind of reasoning allow standard forward- chaining rules to be augmented with unless clauses , which introduce a basis for reasoning by default . Control ( including deciding which default ...
... reasoning systems that support this kind of reasoning allow standard forward- chaining rules to be augmented with unless clauses , which introduce a basis for reasoning by default . Control ( including deciding which default ...
Página 433
... Reasoning Systems In all of our discussions of problem - solving systems until now , we have focused on the design of single systems . In this section , we expand our view , and look at ... REASONING SYSTEMS 433 Distributed Reasoning Systems.
... Reasoning Systems In all of our discussions of problem - solving systems until now , we have focused on the design of single systems . In this section , we expand our view , and look at ... REASONING SYSTEMS 433 Distributed Reasoning Systems.
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