4.1 Instructional Objective •The students should understand the formulation of constraint satisfaction problems •Given a problem description, the student should be able to formulate it in terms of a constraint satisfaction problem, in terms of constraint graphs. •Students should be able to solve constraint satisfaction problems using various algorithms. •The student should be familiar with the following algorithms, and should be able to code the algorithms oBacktracking oForward checking oConstraint propagation oArc consistency and path consistency oVariable and value ordering oHill climbing The student should be able to understand and analyze the properties of these algorithms in terms of otime complexity ospace complexity otermination ooptimality •Be able to apply these search techniques to a given problem whose description is provided. •Students should have knowledge about the relation between CSP and SAT At the end of this lesson the student should be able to do the following: •Formulate a problem description as a CSP •Analyze a given problem and identify the most suitable search strategy for the problem. •Given a problem, apply one of these strategies to find a solution for the problem. Version 1 CSE IIT, Kharagpur
Lesson 9 Constraint satisfaction problems - I Version 1 CSE IIT, Kharagpur
has intentionally blurred sections.
Sign up to view the full version.