f12-csp-sat - Constraint Satisfaction Problems Search when states are factored Until now we assumed states are blackboxes We will now assume that states

f12-csp-sat - Constraint Satisfaction Problems Search when...

This preview shows page 1 - 17 out of 74 pages.

Constraint Satisfaction Problems
Image of page 1
Search when states are factored Until now, we assumed states are black- boxes. We will now assume that states are made up of “state-variables” and their “values” Two interesting problem classes CSP & SAT (Constraint Satisfaction Problems) Planning
Image of page 2
Image of page 3
December 2, 1998 Sqalli, Tutorial on Constraint Satisfaction Problems 4 Constraint Satisfaction Problems (a brief animated overview) Values Constraints Problem Statement Variables CSP Algorithm Solution X Z Y Coloring Problem CSP Representation Search backtracking, variable/value heuristics Inference Consistency enforcement, forward checking X: red Y: blue Z: green Red green blue Red green blue Red green blue Z X Y Constraint Graph
Image of page 4
Red green blue Red green blue Red green blue Z X Y Constraint Graph As a piece of code that takes a partial assignment and returns Legal or not
Image of page 5
Example: N-queen problem N=4 Variables: Queen per column Values: N rows that queen can be in Constraints: no pair in same row, column or diagonal
Image of page 6
Constraint Graphs will be hyper-graphs for non-binary CSPs
Image of page 7
Image of page 8
Image of page 9
“Real world” CSP problems.. Most assignment problems including Time-tabling Variables: Courses; Values: Rooms, times Jobshop Scheduling Variables: jobs; values: machines Sudoku; KenKen Cross-word puzzle Boolean satisfiability Many other AI problems can be compiled to CSP problems We will see how to compile planning into a CSP problem
Image of page 10
Complexity of CSP.. Boolean Satisfiability is a special case of discrete variable CSP problem So, CSP is NP-hard Specific types of CSP may be tractable. E.g. if all the variables are boolean and all the constraints are binary, you have 2-SAT which is tractable. The topology of the “constraint graph” also affects the complexity of the CSP problem E.g. If the constraint graph is a chain graph or a multi-tree, we can solve it polynomially Do you remember the similar result for Bayes Nets?
Image of page 11
CSP vs. SAT CSP allows multi-valued variables; while SAT focuses on boolean variables Can convert CSP into SAT Make a variable V with values 1, 2, 3 into propositions V-1, V-2, V-3 Also need to add a constraint saying that no more than one of them can be true » Usually, as a set of binary mutex constraints ( not V-i or not V-j ) CSP algorithms are written assuming constraints as procedures; SAT algorithms are written assuming clauses as declaratively represented
Image of page 12
CSP/SAT vs. IP/LP Linear programming Maximize a linear objective function 3x+4y+5z over real valued variables Subject to a set of linear constraints x+y <= 2; y+3z <=4 etc Can be understood in two phases Feasibility of the polytope Finding the optimal corner of the polytope Integer programming Linear programming, but (some of) the variables have to take integer values
Image of page 13
Image of page 14
Image of page 15
General Search vs. CSP Blackbox State External Child-generator State-space can be infinite External goal test Goals can occur at any depth
Image of page 16
Image of page 17

You've reached the end of your free preview.

Want to read all 74 pages?

  • Spring '06
  • Staff
  • Economics, Constraint satisfaction, Constraint satisfaction problem, constraint graph

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors