|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Nilsson N.J. — Problem-Solving Methods in Artificial Intelligence |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
Nodes, inference 174—175
Nodes, OR S7
nodes, root 44 219
Nodes, solved 88—89 117
Nodes, start 43
Nodes, tip 128 219
Nodes, top 220
Nodes, unsolvable 90 117
nondeterministic programs 24—27 90—93
Nondeterministic programs for the 15-puzzle 26—27
Nondeterministic programs for the S-queens problem 92
Nondeterministic programs to represent AND/OR graphs 90—93
Nondeterministic programs to represent state spaces 24—27
Nondeterministic programs, choice functions in 38
Nondeterministic programs, correctness of 3S
Nondeterministic programs, history of 38 112
Operations research, branch and bound methods in 11 70
Operations research, state spaces in 10—11
Operator schemas in monkey-and-bananas problem 36
Operator schemas in predicate calculus formulation 207
Operators for the 15-puzzle 4
Operators for the S-puzzle 20—21
Operators in monkey-and-bananas problem 36 106 207 210
Operators in problem-reduction problem solving 85—86
Operators in state-space problem solving 19—21
operators, definition of 4
Operators, formalization of 210
Operators, key 104—105 112—113
Operators, successor 23 44 88
Operators, use of rewriting rules to define 19—21
Optimality of A* 61—65
Optimality of AND/OR tree-search algorithms 136
Optimization problems using state—space approach 22 see
OR nodes in AND/OR graphs 87
Ordered search in resolution theorem proving 227—228 229
Ordered search of AND/OR trees 130—131 132 133
Ordered search of game trees (combined with alpha-beta procedure) 148—149
Ordered search of state—space graphs, algorithm for 55—56
Ordered search of state—space graphs, applied to S-puzzle 55—57 66—68
Ordered search of state—space graphs, evaluation function for 57—58
Ordered search, admissibility of 50—61 131—136
Ordered search, optimality of 61—65
Parent nodes in graphs 22—23
Path cost in AND/OR solution trees 217
Path cost in state-space graphs 23
Paths in graphs 22—23 120
Paths in graphs, cost of 23
Paths in graphs, length of 23
Paths in graphs, minimal cost 23
Penetrance 72—73
Penetrance, graph of 75
Perceptrons 75
Performance measures 72—75 70—77
Planning in problem-reduction problem-solving methods 103—109
Pointers in AND/OR search trees 117—118
Pointers slate-space search trees 44
Positive clauses 227
Potential solution tree 129
Practical applications of problem-solving methods 11
Precondition wffs 206—209
Predicate calculus as a language for problem solving 156—157
Predicate calculus, applications of, to problem solving 187—216
Predicate calculus, applications of, to program writing 201—205
Predicate calculus, applications of, to state-space problem solving 206—212
Predicate calculus, concept of logically follows in 164
Predicate calculus, concept of proof in 104
Predicate calculus, domains for 159
Predicate calculus, formulation of monkey-and-bananas problem in 206—212
Predicate calculus, logical connectives in 158
Predicate calculus, models in 159 171—172 224—225
Predicate calculus, quantifiers in 161—163
Predicate calculus, resolution in 178—183
Predicate calculus, search methods in 217—233
Predicate calculus, semantics of 157 159—161
Predicate calculus, syntax of 157—159
Predicate calculus, translations from English into 188—189
Predicate calculus, treatment of equality in 183—184
Predicate calculus, undecidability of 103
Predicate calculus, variables in 161—163
Predicate evaluation used in automatic theorem proving 218
Predicate letters 158
Prefix of a wff 167
Prenex form 167 see
Primitive problems in problem reduction 6 86—87
Problem solving as performed by animals 9
Problem solving by problem-reduction approach 5—6 80—115
Problem solving by state-space approach 4 17—42
Problem solving by trial-and-error search 2 10
Problem solving by use of logic 6—7 187—210
Problem solving, definition of 2
Problem solving, general purpose 7
Problem states 4
Problem-reduction approach to problem solving 80—115
Problem-reduction approach to problem solving applied to game playing 109—112
Problem-reduction approach to problem solving, comparison with state-space approach 85
Problem-reduction approach to problem solving, examples of representations 93—109
Problem-reduction approach to problem solving, need for search in 86
Problem-reduction approach to problem solving, problem descriptions for 83 85
Problem-reduction approach to problem solving, search methods for 110—155
Problem-reduction approach to problem solving, use of differences in 105—109
Problem-reduction approach to problem solving, use of milestone or stepping stone states in 103—109
Problem-reduction approach to problem solving, use of models in 100—102
Problem-reduction approach to problem solving, use of planning in 103—109
Problem-reduction graphs see AND/OR graphs
productions see Rewriting rules
Program writing, automatic 201—205
Proof graphs 180—182
Proof methods in predicate calculus see Resolution Theorem
Proofs in predicate calculus 104
Proofs, constructive 188
Proposition tree 112 see AND/OR
Provisional backed-up values (PBVs) in alpha-beta procedure 144—145
PROW 213 216
Pruning in AND/OR graphs 118
Pruning in state-space graphs 71—72
Puzzles as example problems 3
Puzzles, 8-queens problem 41 92
Puzzles, books about 12
Puzzles, water-jug problem 40 (2—4) see 15—puzzle Tower-of-Hanoi
Quantifiers in predicate calculus 161—163
Quantifiers, scope of 102 103
QUBIC 154 (6—6)
Question answering 212—213
Question answering, surveys of 213
Queuing problems see Distribution problems
Real problems, examples of 11
Realization of existential quantifiers in answer extraction 180—201
Reasoning about actions 7 see
Reasoning backwards 80 112
Refinement strategies in resolution theorem proving 210—227
Refutation 180
Refutation graphs 180
Refutation graphs, examples of 181 182
Remote manipulation problems 11
Representations as one element of problem solving 8
Representations, good, selection of 35
Representations, literature on 39
Representations, problem-reduction, components of 83—87
Representations, problem-reduction, examples of 93—109
Representations, shifts in 35
Representations, state-space, components of 22
Representations, state-space, examples of 27—34
Representations, using predicate calculus 187—216
Resolution 7
Resolution as modus ponens 179
Resolution principle 157 180—181 134
Resolution, combining strategies in 227
Resolution, definition of 178—183
Resolution, examples of 179
Resolution, fewest components strategy in 228
| Resolution, relative to a model strategy 224—227 229
Resolution, relative to a refinement criterion 219
Resolution, relative to an ancestry filter 221—222 229
Resolution, search methods for 217—233
Resolution, set-of-support strategy in see Set-of-support strategy as
Resolution, simplification strategies in 215—210
Resolution, soundness and completeness of 181—183
Resolution, unit preference strategy in 228 229
Resolution, use of evaluation functions in 220—230
Resolvent 174 178—179
Rewriting rules , examples of 20
Rewriting rules as operators 19—21
Rewriting rules for arrays 20—21
Rewriting rules for S-puzzle 20—21
Rewriting rules for strings 19—21 30
Root node in resolution proof graphs 210
Root node in trees 44
SAINT program 93—97 112
Satisfiability of a set of wffs 164
Satisfiability of a wff 161
Schemas as used by Newell and by Fikes 39
Schemas operator 35—37 207
Schemas, state-description 35—37 207
Schemas, variables in 35—37
Scope of quantifiers 162 163
Search as one element of problem solving 8
Search graphs in AND/OR graph searching 118
Search in problem-reduction approach 6
Search in resolution theorem proving 217—233
Search in stair-space approach 4
Search of AND/OR graphs 123—126
Search of AND/OR graphs, breadth-first 119—121
Search of AND/OR graphs, depth-first 121—124
Search of AND/OR graphs, ordered 130—133
Search of game trees, using alpha-beta 140—149
Search of game trees, using dynamic ordering 149
Search of game trees, using fixed ordering 148—149
Search of game trees, using minimax 137—140
Search of state-spare graphs 23
Search of state-spare graphs using A* 57—68
Search of state-spare graphs, breadth-first 44 45—48
Search of state-spare graphs, depth-first 48—51
Search of state-spare graphs, ordered 54—57
Search of state-spare graphs, uniform cost 40—49
Search trees, definition of 45
Search trees, pointers in 44 117—118
Search, bidirectional 76
Search, blind 44
Search, efficiency of 62 72—75 147—148
Search, evaluation functions for see Evaluation functions
Search, heuristic 44 53—54
Search, merit functions for 151
Search, primacy of 10
Search, trial-arid-error 2 10
Semantic trees 170—171 184
Semantic trees, closed 172—173
Semantics of predicate calculus 157 159—161 see
Sequential decoding problems 11
Set-of-support strategy as special case of resolution, relative to a model 226—227
Set-of-support strategy as special case of resolution, relative to ancestry filter criterion 223—224
Set-of-support strategy, completeness of 223—224 226—227
Set-of-support strategy, literature on 229
Shallow search, use in searching game trees 148
Shifts in representations 35
Simplification strategies in resolution theorem proving 218—219
SIN program 112
Skolem functions in answer statements 197—198
Skolem functions, definitions of 166
Solution graph in an AND/OR graph 89
Solution tree in AND/OR graph searching, cost of 126—128
Solution tree in AND/OR graph searching, cost of, estimated 127—128
Solution tree in AND/OR graph searching, optimal 127
Solution tree in AND/OR graph searching, potential 129
Solved nodes in AND/OR graphs 88—98 117
SORT program, example of automatic program writing 201—205
Soundness of resolution 181—183
Staged search 71 137
Start nodes 43
State descriptions see States descriptions
State spaces defined by nondeterministic programs 24—27
State spaces for 15-puzzle 4—5
State spaces in control theory 10
State spaces in operations research 10—11
State spaces in problem solving 4
State spaces using predicate calculus 200—212
State spaces, elements of 22
State spaces, examples of 27—34
State spaces, formalization of 209—212
State spaces, higher level 109
State spaces, search of see Search of
State terms in problem solving using predicate calculus 209
State-space graphs 4 22—23
State-space graphs for lo-puzzle 4 5
State-space graphs for monkey-and-bananas problem 37
State-space graphs for Tower-of-Hanoi puzzle 82
State-space graphs, implicit and explicit 23
State-space graphs, notation 22—23
State-space graphs, representation by nondeterministic programs 24—27
State-space graphs, searching of 23 43—79
States, descriptions of 17—19
States, descriptions of, by binary trees IS
States, descriptions of, by predicate calculus wffs 206
States, descriptions of, by strings 19
States, descriptions of, for algebraic expressions 18—19
States, goal 22
States, in problems, definition of 4
Static evaluation functions for game trees 318
Static evaluation functions for tic-tac-toe 139—140
Static evaluation functions, backed-up values of 139
Strings as state descriptions 19
Strings, rewriting rules for 19—21
Subproblem graph see AND/OR graphs
Subproblems in problem reduction approach 5 80
Subproblems in Tower-of-Hanoi puzzle 81—83
Substitution instance 176
Substitutions 176
Subsumption 218
Subsumption, elimination by 218 228—229
Successor operator for AND/OR graphs 88
Successor operator for state-space graphs 23 44
Successors in graphs 22—23
Successors, generated one at a time 72
Successors, limitation of 71—72
Sum cost of AND/OR solution trees 126—127
Surveys of artificial intelligence 12
Surveys of branch and bound methods 11
Surveys of methods for finding shortest paths 76
Surveys of proving the correctness of programs 213
Surveys of question answering 213
Surveys of the traveling—salesman problem (Bellmore and Nemhauser) 14
Surveys of theorem proving 184
Surveys of translators for computer languages 39
Syntax analysis as example of state-space problem solving 28—30
Syntax of predicate calculus 157—159
Tautologies 190n
Tautologies, elimination of 218
Terms 158
Theorem proving 7
Theorem proving in mathematics 214
Theorem proving in plane geometry 97
Theorem proving in predicate calculus 156—186
Theorem proving survey of 184 see
Theorem proving, implementations of programs for 230
Tic-tac-toe, minimax search applied to 139—140 141—143
Tic-tac-toe, three-dimensional 154(5—6)
Tip nodes in resolution proof graphs 219
Tip nodes of AXD/OR trees 128
Top node in an AFF proof graph 220
Tower-of-Hanoi puzzle 80—83
Tower-of-Hanoi puzzle, reduction to subproblems 81—83
|
|
|
| Ðåêëàìà |
|
|
|
|
|
|
|
|
Î ïðîåêòå