Lesson 09 - Module 4 Constraint satisfaction problems...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Module 4 Constraint satisfaction problems Version 1 CSE IIT, Kharagpur
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
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 o Backtracking o Forward checking o Constraint propagation o Arc consistency and path consistency o Variable and value ordering o Hill climbing The student should be able to understand and analyze the properties of these algorithms in terms of o time complexity o space complexity o termination o optimality 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
Image of page 2
Lesson 9 Constraint satisfaction problems - I Version 1 CSE IIT, Kharagpur
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon