By the end of this lecture
Four things you can do.
Name the toolkit
Place propositional logic, FOL, Datalog, ASP, and description logic on the expressivity/complexity ladder.
Trace an inference
Run forward and backward chaining, unification, and resolution on a small example.
Explain search and planning
Say why A* is optimal with an admissible heuristic, and why planning is PSPACE-complete in the worst case.
Separate power from price
State what symbolic AI is strong and weak at — and map a symbolic component onto the five interfaces.