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 65
Página xi
... Planning System . 333 13.4 Goal Stack Planning 339 13.5 Nonlinear Planning Using Constraint Posting 347 13.6 Hierarchical Planning 354 13.7 Reactive Systems . 356 13.8 Other Planning Techniques 357 13.9 Exercises . 357 14 Understanding ...
... Planning System . 333 13.4 Goal Stack Planning 339 13.5 Nonlinear Planning Using Constraint Posting 347 13.6 Hierarchical Planning 354 13.7 Reactive Systems . 356 13.8 Other Planning Techniques 357 13.9 Exercises . 357 14 Understanding ...
Página 347
... plans directly . In the next section , we present a technique for doing this . 13.5 Nonlinear Planning Using Constraint Posting The goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a ...
... plans directly . In the next section , we present a technique for doing this . 13.5 Nonlinear Planning Using Constraint Posting The goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a ...
Página 356
... planning system to work with STRIPS - like rules , it must be told , in addition to the rules themselves , the appropriate criticality value for each term that may occur in ... planning capability , 356 CHAPTER 13. PLANNING Reactive Systems.
... planning system to work with STRIPS - like rules , it must be told , in addition to the rules themselves , the appropriate criticality value for each term that may occur in ... planning capability , 356 CHAPTER 13. PLANNING Reactive 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