1. Big Ideas in Cmput366

2. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local and Stochastic Search Randomized algorithm Constraint satisfaction CSP representation Constraint propagation, arc consistency Games and Adversarial Search Minimax Alpha-Beta

3. Logic Propositional and first order Semantics: model, logic entailment question: KB |= A ? Inference: Inference rules, soundness, completeness, forward-chaining, resolution, unification, DPLL, unit propagation. Knowledge representation: SAT encoding, FOL encoding

4. FOL may not be suitable Common sense reasoning - default, non-monotonic reasoning - closed work assumption - beliefs may be conflicting, changing

5. Answer Set Programming Variant of SAT but non-monotonic Closed world assumption by negation by failure Stable models capture reasoning by rules rather than clauses General programming methodology: Generate-and-constraint Cardinality constraints make generate easier to express

6. Planning STRIPS language: state, goal, action, action effects, frame axioms Search: forward, backward, partial-order Planning in ASP - fix the number of steps - representation of action system

7. Probability Uncertainty and Probability Joint probability distribution Cond. Probability/Product rule Inference - summing out/hidden vars - Bayes rule (cause/effect by effect/cause) - Chain rule (joint prob by a chain of cond. prob; independence reduces size)

8. Bayesian Network Representation of independence; a node only directly influenced by its parent nodes, not others O(n · 2 k ) numbers where k is the max number of parents Exact computation based on semantics: P (X 1, …,X n ) = π i =1 P (X i | X 1, …, X i-1 ) (chain rule) = π i =1 P (X i | Parents(X i )) (by construction)