Scribd
Upload
63 views32 pages

Unit 3 CSP

Constraint satisfaction problems involve finding objects that satisfy a set of constraints. A CSP is defined by variables with domains of possible values and constraints specifying allowable value combinations. A solution assigns values to variables without violating constraints. Common examples include map coloring, the n-queens problem, and scheduling. CSPs can model many real-world problems and are often solved using search algorithms.

Uploaded by

Sharanya Emmadisetty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
63 views32 pages

Unit 3 CSP

Constraint satisfaction problems involve finding objects that satisfy a set of constraints. A CSP is defined by variables with domains of possible values and constraints specifying allowable value combinations. A solution assigns values to variables without violating constraints. Common examples include map coloring, the n-queens problem, and scheduling. CSPs can model many real-world problems and are often solved using search algorithms.

Uploaded by

Sharanya Emmadisetty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 32

CONSTRAINT

SATISFACTION
PROBLEMS(CSP)
UNIT-3
• Constraint satisfaction problems (CSP) are mathematical problems where one must
find states or objects that satisfy a number of constraints or criteria.
• A constraint is a restriction of the feasible solutions in an optimization problem.
• Some examples for CSP's are:
• The n-queens problem
• A crossword puzzle
• A map coloring problem
• The Boolean satisfiability problem
• A cryptarithmetic problem
• All these examples and other real life problems like time table scheduling, transport
scheduling, floor planning etc. are instances of the same pattern,
• A Constraint Satisfaction Problem(or CSP) is defined by a set of variables {X1,X2,
….Xn,} and a set of constraints {C1,C2,…,Cm}. Each variable Xi has a nonempty
domain D, of possible values. Each constraint Ci involves some subset of variables
and specifies the allowable combinations of values for that subset.

• A State of the problem is defined by an assignment of values to some or all of the


variables,{Xi = vi, Xj = vj,…}. An assignment that does not violate any constraints is
called a consistent or legal assignment.

• A complete assignment is one in which every variable is mentioned, and a solution to


a CSP is a complete assignment that satisfies all the constraints. Some CSPs also
require a solution that maximizes an objective function.
Example for Constraint Satisfaction Problem
• The map coloring problem. The task of coloring each region red,
green or blue in such a way that no neighboring regions have the
same color.
• Map of Australia showing each of its states and territories
• We are given the task of coloring each region either red, green, or
blue in such a way that the neighboring regions must not have the
same color.

• To formulate this as CSP, we define the variable to be the regions: WA,


NT, Q, NSW, V, SA, and T.

• The domain of each variable is the set {red, green, blue}.


• The constraints require neighboring regions to have distinct colors: for
example, the allowable combinations for WA and NT are the pairs
• {(red,green),(red,blue),(green,red),(green,blue),(blue,red),
(blue,green)}.

• (The constraint can also be represented as the inequality WA ≠ NT)

• There are many possible solutions, such as { WA = red, NT = green, Q


= red, NSW = green, V = red ,SA = blue,T = red}.
• Constraint Graph : A CSP is usually represented as an undirected
graph, called constraint graph where the nodes are the variables and
the edges are the binary constraints.
• The map-coloring problem represented as a constraint graph.
CSP can be viewed as a standard search
problem as follows :
• Initial state : the empty assignment {},in which all variables are
unassigned.
• Successor function : a value can be assigned to any unassigned variable,
provided that it does not conflict with previously assigned variables.
• Goal test : the current assignment is complete.
• Path cost : a constant cost(E.g.,1) for every step.
Every solution must be a complete assignment and therefore appears at
depth n if there are n variables. So Depth first search algorithms are
popular for CSPs.
Varieties of CSPs
• Discrete variables
• Discrete variables can have
1. Finite Domains
2. Infinite domains

Continuous variables
• e.g., start/end times for Hubble Space Telescope observations
• linear constraints solvable in polynomial time by linear
programming
Finite domains
• The simplest kind of CSP involves variables that are discrete and have finite domains.

• Map coloring problems are of this kind. The 8-queens problem can also be viewed as
finite-domain CSP, where the variables Q1,Q2,…..Q8 are the positions each queen in
columns 1,….8 and each variable has the domain {1,2,3,4,5,6,7,8}.

• If the maximum domain size of any variable in a CSP is d, then the number of
possible complete assignments is O(dn) – that is, exponential in the number of
variables.

• Finite domain CSPs include Boolean CSPs, whose variables can be either true or false.
Infinite domains
• Discrete variables can also have infinite domains – for example, the
set of integers or the set of strings.
• With infinite domains, it is no longer possible to describe constraints
by enumerating all allowed combination of values.
• For example, if Jobl, which takes five days, must precede Jobs, then
we would need a constraint language of algebraic inequalities such as

• Startjob1 + 5 <= Startjob3.


Continuous domains
• CSPs with continuous domains are very common in real world.
• For example, in operation research field, the scheduling of
experiments on the Hubble Telescope requires very precise timing of
observations;
• the start and finish of each observation and maneuver are
continuous-valued variables that must obey a variety of astronomical,
precedence and power constraints.
• The best known category of continuous-domain CSPs is that of linear
programming problems, where the constraints must be linear
inequalities forming a convex region.
• Linear programming problems can be solved in time polynomial in the
number of variables.
Varieties of constraints :
• Unary constraints – Which restricts a single variable. Example : SA ≠
green
• Binary constraints - relates pairs of variables. Example : SA ≠ WA
• Higher order constraints involve 3 or more variables.
• Example : cryptarithmetic puzzles. Each letter stands for a distinct
digit
• The aim is to find a substitution of digits for letters such that the
resulting sum is arithmetically correct, with the added restriction that
no leading zeros are allowed.

You might also like