constraint satisfaction problems n.
Skip this Video
Loading SlideShow in 5 Seconds..
Constraint Satisfaction Problems PowerPoint Presentation
Download Presentation
Constraint Satisfaction Problems

Constraint Satisfaction Problems

118 Views Download Presentation
Download Presentation

Constraint Satisfaction Problems

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Constraint Satisfaction Problems • Constraint Satisfaction Problem (CSP) • Set of Variables: X1, X2, X3, … Xn • Set of Constraints: C1, C2, … Cn • Each Xihas a non-empty domainDiof possible values,vi. • Each Ci has a subset of variables specifying the combination of vi’s.

  2. Constraint Satisfaction Problems • A problem state or assignment is represented by: • {Xi = vi, Xj = vi, ...} • An assignment is consistent if no constraints are violated. • Constraint Graph • Nodes represent variables • Arcs represent constraints

  3. CSP Example • Graph coloring is a good example of a CSP. • Assume we can use the colors {red, blue, yellow} • Can we color the graph such that a each adjacent node has a different color? Let’s choose blue for X1? What if we connect X5 to X2? X1 X2 What color can we choose for X2? X3 X5 Now what can we choose for X3? Does it matter what color we choose for X4? X4 What about X5?

  4. CSP Example • What happens if we only have two colors {red, blue}? Does adding the link between X2 and X5 change the problem? X1 X2 X3 X5 X4

  5. Characteristics of CSP • Every problem must be a complete assignment. • Assume n variables, then search tree only goes to depth n. • Depth first search typically applied. • General CSP algorithms solve problems significantly larger than those that can be solved with general search algorithms.

  6. Simplest CSPs • CSPs with discrete variables and finite domains. • Map-coloring • 8-Queens • Boolean CSPs – 3SAT (NP-Complete)

  7. More complex CSPs • Discrete variables with infinite domains. • For example, a set of integers. • Characteristic of such problems • Cannot enumerate all variable combinations. • Requires a constraint language. • Continuous Domains • Example, linear progamming.

  8. Types of Constraints • Unary Constraint • Constrains the value of a single variable. • Binary Constraint • Relates two variables. • Preference Constraint • Indicate preferred solutions.

  9. Backtracking • A depth-first search that chooses values for one variable at a time and backtracks when a variable has no legal values left to assign is a backtracking search. • What have we learned about backtracking in the past?

  10. Questions to address • What variable to assign next and what order are the values to be tested? • What are the implications of the current variable assignments on the other unassigned variables? • When a path fails, how do we avoid repeating the failure on subsequent paths?

  11. Which variable to assign? • Which variable to assign? • Standard backtracking simply assigns the next available variable. • It is rare that this is efficient. • Is there a way to chose the variable with the fewest “legal” values?

  12. Which variable to assign? • Minimum remaining values (MRV) • Simply select the variable with the fewest “legal” values. • If a variable has no legal values, then MRV selects the variable and the failure is immediately detected. • Can be implemented by changing the selection criteria of backtracking search.

  13. Which variable to assign? • MRV is useful if have already started the search. • How is the first variable chosen? • Degree Heuristic • Choose the variable involved with the largest number of constraints with other unassigned variables. • Can also be used as a tie-breaker in all other situations.

  14. Which variable to assign? • Degree Heuristic X1 X2 Which Variable has the largest number of constraints? X3 X5 X4 How does the algorithm know the order in which to examine values?

  15. Least-Constraining-Value • Chose the value that rules out the fewest choices for the neighboring variables in the constraint graph. • Attempts to provide maximum flexibility for remaining variable assignments

  16. What are the implications of an assignment? • Can we reduce the search space by looking at constraints earlier in the search process? • Forward Checking • Constraint Propagation

  17. Forward Checking • When variable X is assigned, check each unassigned variable Y connected to X by a constraint. • Delete from Y’s domain any value that is inconsistent with the value assigned to X. • Problem: Does not catch all inconsistencies. • Why?

  18. Constraint Propagation • Propagate the implications of a constraint on one variable onto other variables. • Must be able to do this quickly. • Why?

  19. Arc Consistency • Requires a directed arc in the consistency graph. • Provides early detection of inconsistencies. • Must be applied repeatedly to detect ALL constraints.

  20. Arc Consistency X1 X2 {R, Y} {R, Y, B} {R, Y, B} {Y, B} X3 X5 {B} {Y, B} {R, Y, B} X4 {R, Y} Still may not find all inconsistencies.

  21. K-Consistency • A CSP is k-consistent if for any set of k – 1 variables and for any constraint assignment to those variables, a consistent value can always be assigned to any kth value.

  22. K-Consistency • Node Consistency (1-Consistency) • Each individual variable is consistent. • 2-Consistency = arc consistency • Path Consistency (3-Consistency) • Any pair of adjacent variables can always be extended to a third neighboring variable. • Stronger consistency checks require more processing time but reduce the branching factor and detection of inconsistencies.

  23. Special Constraints • AllDiff – All variables must have distinct values. • To satisfy this constraint for m variables and n values, n >= m. Why? • Resource (atmost) constraint • Define an atmost constraint value and then add the minimum values of the current domains. • The sum must be less than or equal to the constraint value.

  24. How is repeating failures avoided? • Chronological backtracking • Backs up to the most recent decision point and tries a different value for it.

  25. Chronological Backtracking X1 X2 • Back up to the conflict set • The variables that caused the problem. • Typically the set for X is the set of previously assigned variables connected to X by constraints. X3 X5 Simple backtracking takes us to X5. What happens? X4

  26. Backjumping • Backtracks to the most recent variable in the conflict set. • Every branch pruned by backjumping is also pruned by forward checking.

  27. Conflict-directed backjumping • Modify backjumping to use conflict sets that include not only the variables with a direct conflict but also any subsequent variables with no consistent solution. • Look backwards and expand the conflict set.

  28. Conflict-Directed Backjumping • Let Xj be the current variable, and let conf(Xj) be its conflict set. If every possible value for Xj fails, backjump to the most recent variable Xi in conf(Xj), and set conf(Xi) conf(Xi) conf(Xj) – {Xi}. • Does this stop us from making the same mistake in another branch of the same tree?

  29. Local Search • Section 4.3 discussed local search algorithms. • Can be quite effective for CSP. • Fairly efficient • Can be used on-line when a problem changes. • Min-conflicts heuristic • Choose the variable with the fewest conflicts with other variables.