Artificial Intelligence: Structures and Strategies for Complex Problem SolvingIn this accessible, comprehensive text, George Luger captures the essence of artificial intelligence-solving the complex problems that arise wherever computer technology is applied. Key representation techniques including logic, semantic and connectionist networks, graphical models, and many more are introduced. Presentation of agent technology and the use of ontologies are added. A new machine-learning chapter is based on stochastic methods, including first-order Bayesian networks, variants of hidden Markov models, inference with Markov random fields and loopy belief propagation. A new presentation of parameter fitting with expectation maximization learning and structure learning using Markov chain Monte Carlo sampling. Use of Markov decision processes in reinforcement learning. Natural language processing with dynamic programming (the Earley parser) and other probabilistic parsing techniques including Viterbi, are added. A new supplemental programming book is available online and in print: "AI Algorithms in Prolog, Lisp and Java (TM). "References and citations are updated throughout the Sixth Edition. For all readers interested in artificial intelligence. |
From inside the book
Results 1-3 of 91
Page 99
... search , taking the root as a start state and evaluating its children to search for the goal . The algorithm can be viewed as a goal - driven search by letting the goal be the root of the graph and evaluating descendants ... SPACE SEARCH 99.
... search , taking the root as a start state and evaluating its children to search for the goal . The algorithm can be viewed as a goal - driven search by letting the goal be the root of the graph and evaluating descendants ... SPACE SEARCH 99.
Page 106
... search is a linear function of the length of the path . At each level , open retains only the children of a single state . If a graph has an average of B children per state , this requires a total space usage of B x n states to go n ...
... search is a linear function of the length of the path . At each level , open retains only the children of a single state . If a graph has an average of B children per state , this requires a total space usage of B x n states to go n ...
Page 159
Structures and Strategies for Complex Problem Solving George F. Luger. Measuring a search space is usually an empirical process done by considerable play- ing with a problem and testing its variants . Suppose , for example , we wish to ...
Structures and Strategies for Complex Problem Solving George F. Luger. Measuring a search space is usually an empirical process done by considerable play- ing with a problem and testing its variants . Suppose , for example , we wish to ...
Other editions - View all
Artificial Intelligence: Structures and Strategies for Complex Problem Solving George F. Luger No preview available - 2009 |
Common terms and phrases
8-puzzle agent applied approach arcs artificial intelligence backtrack Bayesian best-first search breadth-first search called Chapter clause complex components concept conceptual graphs consider data-driven defined definition depth-first search described determine elements evaluation example expert systems Figure finite state machine formal function genetic genetic algorithms goal goal-driven heuristic search human implement important inference rules input instance interpretation knowledge base logic machine learning match memory modus ponens move natural language node noun operators output parse pattern possible predicate calculus expressions presented probabilistic probability problem domain problem solving production system Prolog propositional calculus reasoning recursive relationships represent representation result robot S₁ search algorithms search space Section semantic sentence sequence situation solver space search stochastic strategy strings structure subgoals substitutions symbols techniques theorem theory tic-tac-toe tion transition tree true truth tables truth value unification unify variable vector verb