CSP examples Backtracking search for CSPs Problem structure and problem decomposition Local search for CSPs

Best-first Search (最佳优先搜索) Greedy search A* search Local Search Algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms

Problem-solving Agents Searching for Solutions Uninformed Search Strategies

Agents and Environments PEAS (Performance measure, Environment, Actuators, Sensors) Environment Types Agent Types

• Reducing first-order inference to propositional inference • Unification • Generalized Modus Ponens • Forward chaining • Backward chaining • Resolution

• Why FOL? • Syntax and semantics of FOL • Using FOL • Wumpus world in FOL • Knowledge engineering in FOL

• Knowledge-based agents • Wumpus world • Logic in general - models and entailment • Propositional (Boolean) logic • Equivalence, validity, satisfiability • Inference rules and theorem proving – forward chaining – backward chaining – resolution

• Optimal decisions • α-β pruning • Imperfect, real-time decisions

Constraint Satisfaction Problems (CSP) Backtracking search for CSPs Local search for CSPs

• Best-first search • Greedy best-first search • A* search • Heuristics • Local search algorithms • Hill-climbing search • Simulated annealing search • Local beam search • Genetic algorithms