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 32
Página 38
... backtracking is called chronological backtracking because the order in which steps are undone depends only on the temporal sequence in which the steps were originally made . Specifically , the most recent step is always the first to be ...
... backtracking is called chronological backtracking because the order in which steps are undone depends only on the temporal sequence in which the steps were originally made . Specifically , the most recent step is always the first to be ...
Página 212
... backtracking , one that is based on logical dependencies rather than the chronological order in which decisions were made . We call this new method dependency - directed backtracking [ Stallman and Sussman , 1977 ] , in contrast to ...
... backtracking , one that is based on logical dependencies rather than the chronological order in which decisions were made . We call this new method dependency - directed backtracking [ Stallman and Sussman , 1977 ] , in contrast to ...
Página 389
... backtrack to try some other path . There are two important drawbacks to this approach . The first is that a good deal of time may be wasted saving state descriptions at each choice point , even though backtracking will occur to only a ...
... backtrack to try some other path . There are two important drawbacks to this approach . The first is that a good deal of time may be wasted saving state descriptions at each choice point , even though backtracking will occur to only a ...
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