Constraint Satisfaction Problem
Constraint Satisfaction Problems
What is a CSP?
Finite set of variables X1, X2, , Xn
Nonempty domain of possible values for each variable
D1, D2, , Dn
Finite set of constraints C1, C2, , C
Problem Solving by Searching
Complete architectures for intelligence?
Solve the problem of what to do.
Learn what to do.
Logic and inference?
Reason about what to do.
What is AI?
Views of AI fall into four categories
1. Thinking humanly
2. Acting humanly
3. Thinking rationally
4. Acting rationally
Introduction to AI
What is AI?
A brief history
State of the Art
Intro to AI (chapter 1)
Intelligent agents (chapter 2)
Goal based agents and uninformed search(chapter 3.1-3.4)
Local Search Algorithms
Gradient Ascent/Descent in continuous spaces
Simulated annealing search
Local beam search
Local search algorithms
In many optimiza
Why Do We Need Logic?
Problem-solving agents were very inflexible
hard code every possible state
E.g., in the transition of 8-puzzle problem, knowledge of what each
action can do is hidden inside the R
Two agents whose actions alternate
Utility values for each agent are the opposite of the
This creates the adversarial situation
Fully observable environments
In game theory t