Artificial IntelligenceNew Age International, 2007 - 384 pagine This Innovative Book On Artificial Intelligence (Ai) Uses The Unifying Thread Of Search To Bring Together The Major Application And Modeling Techniques That Use Symbolic Ai. Each Of The 11 Chapters Is Divided Into 3 Sections:# Section Which Introduces The Techniques# Section Which Develops A Low-Level (Pop-11) Implementation# Section Which Develops A High-Level (Prolog) ImplementationComprehensive Yet Practical, This Book Will Be Of Great Value To Those Experienced In Ai, As Well As To Students With Some Programming Background And Academics And Professionals Looking For A Precise Discussion Of Ai Through Search.This Special Low-Priced Edition Is For Sale In India, Bangladesh, Bhutan, Maldives, Nepal, Myanmar, Pakistan And Sri Lanka Only. |
Dall'interno del libro
Risultati 1-5 di 86
Pagina v
Spiacenti. Il contenuto di questa pagina č ad accesso limitato..
Spiacenti. Il contenuto di questa pagina č ad accesso limitato..
Pagina vii
... Prolog Further reading 2 Simple State Space Search Path - finding Setting up the database Setting up the path - finding function The generality of search Search spaces and search trees Constructing an explicit representation of the ...
... Prolog Further reading 2 Simple State Space Search Path - finding Setting up the database Setting up the path - finding function The generality of search Search spaces and search trees Constructing an explicit representation of the ...
Pagina viii
... Prolog Iterative deepening in Prolog Agendas in Prolog Reading ....... Exercises Notes .... 4 Heuristic State Space Search Introduction The 8 - puzzle ............. Constructing 8 - puzzle successors Heuristic search ..... Hill ...
... Prolog Iterative deepening in Prolog Agendas in Prolog Reading ....... Exercises Notes .... 4 Heuristic State Space Search Introduction The 8 - puzzle ............. Constructing 8 - puzzle successors Heuristic search ..... Hill ...
Pagina ix
... Prolog Reading Exercises Notes .... 7 Planning ( microworld search ) Introduction Operators Strategies for ... Prolog Reading ...... Exercises 125 130 131 131 133 133 133 136 138 139 141 145 150 153 155 159 161 162 162 168 168 169 171 Ll ...
... Prolog Reading Exercises Notes .... 7 Planning ( microworld search ) Introduction Operators Strategies for ... Prolog Reading ...... Exercises 125 130 131 131 133 133 133 136 138 139 141 145 150 153 155 159 161 162 162 168 168 169 171 Ll ...
Pagina x
... Prolog The Prolog grammar rule formalism 216 219 Bottom - up parsing in Prolog ........ Why is parsing useful .................. 221 225 Building a top - level interpreter Meaning in Prolog Reading ..... Exercises 9 Expert Systems ...
... Prolog The Prolog grammar rule formalism 216 219 Bottom - up parsing in Prolog ........ Why is parsing useful .................. 221 225 Building a top - level interpreter Meaning in Prolog Reading ..... Exercises 9 Expert Systems ...
Sommario
SearchRelated Techniques in AI | 1 |
Simple State Space Search | 15 |
State Space Search | 43 |
Heuristic State Space Search | 71 |
Heuristic Search of Game Trees | 107 |
Problem Reduction ANDORtree search | 133 |
Planning microworld search 171 Ll | 171 |
Parsing search as analysis | 201 |
Expert Systems probabilistic search | 243 |
Concept learning description search | 267 |
Prolog search as computation | 293 |
321 | |
A1 Function to double a number | 330 |
A5 Function to compare two numbers | 343 |
Parole e frasi comuni
8-puzzle achievel agenda alpha-beta pruning alphabeta_search already true AND/OR-tree backwards backwards_parse_tree backwards_search_tree backwards_search_value backwards_search1 true behaviour block boolean box closed box open breadth-first breadth-first search called car wont certainty chapter chatty clocktower command corresponding current_location database define deletions depth limit depth-first search elseif endde endfor endif enddefine Exit extended paths extended_paths fact false Figure foreach forwards_parse_goals forwards_parse_trees girl given goal node hanoi heuristic hole implement input instantiated iterative deepening list of goals lookahead loop matches meaning minimax minimax_search move MYCIN New_agenda new_paths node noun computer np snp old_steine operator other_goals parse parse tree path_so_far preconditions preston_circus Prolog pruning readline recursive REF object returns true rulebase search function search rules search space search tree search_path search_type sequence seven_dials showtree solution tree space search sticks structure subgoals subtrees successor function successor node takes a list the_level tile tion unify true variable