Constraint Satisfaction in Artificial Intelligence

Constraint Satisfaction

1) Many problem in AI can be viewed as problem of constraint satisfaction in which the goal is to discover some problem state that satisfies a given set of constraints.

2) Constraint satisfaction is the process  of finding a solution to a set of constraints that imposes the condition that the variable must be satisfied .

3) The techniques used in constraint satisfaction depend on the kind of constraints being considered.

4) 

Example of constraint satisfaction is crypt arithmetic puzzles and many real world perceptual labeling problems.

5) Statement of Constraints :

a) Values are to be assigns to the letters from 0 to 9.

b) No two letters should have the same value.

c)If the same letter occur more than one it must be used in same digit each time.

d) The sum of digit must be accurate.

consider following cryptarithmetic problem.

6) The goal state is a problem state in which all letters have been assigned a digit in such a way that all the initial constraints are satisfied.

 

Problem:

 

                           S       E      N    D  

                          (9)    (5)    (6)    (7)   -- Values

              +          M     O      R      E

                         (1)    (0)     (8)    (5)  - Values

                   _____________________

          M            O     N        E       Y

         (1)           (0)    (6)      (5)    (2)

S=9 , M= 1, E =5, O =0 ,N=6,R=8, D=7,  Y= 2

 

SHARE

Milan Tomic

Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.

• 
• 
• 
• 
•