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 11
Página 85
... subgoals . A simple example of this failure is shown in Figure 3.10 . Assuming that both node C and node E ultimately lead to a solution , our algorithm will report a complete solution that includes both of them . The AND - OR graph ...
... subgoals . A simple example of this failure is shown in Figure 3.10 . Assuming that both node C and node E ultimately lead to a solution , our algorithm will report a complete solution that includes both of them . The AND - OR graph ...
Página 191
... subgoals can interact with one another . In the process of solving one subgoal , we may undo our solution of a previous subgoal . Search control knowledge can tell us something about the order in which we should pursue our subgoals ...
... subgoals can interact with one another . In the process of solving one subgoal , we may undo our solution of a previous subgoal . Search control knowledge can tell us something about the order in which we should pursue our subgoals ...
Página 551
... subgoals whose success would enable the rules to be invoked . These subgoals are again matched against rules , and their preconditions are used to set up additional subgoals . Whenever a 20.3 . EXPLANATION 551.
... subgoals whose success would enable the rules to be invoked . These subgoals are again matched against rules , and their preconditions are used to set up additional subgoals . Whenever a 20.3 . EXPLANATION 551.
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