PirateBay Download | nilsson n problem solving methods artificial intelligen 1971

nilsson n problem solving methods artificial intelligen 1971

Type:: E-books
Files:: 1
Size:: 80.8 MB
Uploaded On:: June 27, 2022, 9:53 a.m.
Added By:: andryold1
Seeders:: 2
Leechers:: 0
Info Hash:: 59BEA93897F9F60F2FFBDFE4E7BDF90A7BEE7BF0

Textbook in PDF format Introduction Bibliographical and historical remarks Problem-solving and artificial intelligence Puzzles and games as example problems Problem states and operators Reducing problems to subproblems The use of logic in problem solving Two elements of problem solving: representation and search Problems References State-space representations State descriptions Operators Goal states Graph notation Representation of state spaces by nondeterministic programs Some example problem representations Selecting «good» representation Bibliographical and historical remarks Problems References State-space search method Graph-searching processes Breadth-first methods A depth-first method Modifications needed when searching graphs Discussion of heuristic information Use of evaluation functions An optimal search algorithm The admissibility of A * The optimality of A * The heuristic power of A The importance of g Use of other heuristics Measures of performance Bibliographical and historical remarks Problems References Problem-reduction representations An example of a problem-reduction representation Problem descriptions Problem-reduction operators Primitive problem descriptions AND/OR graphs Representation of AND/OR graphs by nondeterministic programs Examples of problem-reduction representations Planning mechanisms in problem reduction Key operators Differences Higher-level state spaces Games Bibliographical and historical remarks Problems References Problem-reduction search methods AND/OR graph-searching processes Breadth-first search Depth-first search Searching AND/OR graphs Costs of solution trees Using cost estimates to direct search An ordered search algorithm for AND/OR trees Admissibility of the ordered-search algorithm Selecting a node in r0 to expand next Modifications The minimax procedure for searching game trees The alpha-beta procedure The search efficiency of the alpha-beta procedure Combined alpha-beta and ordering procedures Possible improvement on minimax-based methods Bibliographical and historical remarks Problems References Theorem-proving in the predicate calculus Predicate calculus as a language for problem solving Syntax Semantics Variables and quantifiers Validity and satisfiability Clause form The Herbrand universe The Herbrand base Constructing a semantic tree Failure nodes Inference nodes Unification Resolvents The resolution principle Soundness and completeness of resolution Bibliographical and historical remarks Problems References Applications of the predicate calculus in problem solving The predicate calculus in problem solving An example The answer-extraction process Conjectures containing universally quantified variables An automatic program-writing example The use of the predicate calculus in state-space problem solving A formalization for state-space problem solving Bibliographical and historical remarks Problems References Predicate-calculus proof-finding methods Search Strategies Simplification strategies Refinement strategies Ancestry-filtered form proofs Set-of-support strategy More restrictive strategies Model strategies P1 refutations Combined strategies Ordering strategies Bibliographical and historical remarks Problems References Combined references and author index Subject index

Get This Torrent

Nilsson N. Problem-solving methods in artificial intelligence 1971.pdf 80.8 MB

Details for: Nilsson N. Problem-solving methods in artificial intelligen.1971

nilsson n problem solving methods artificial intelligen 1971