Syllabus

MA61026
Course name	Constraint Satisfaction Problems
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	{{{semester}}}

Syllabus mentioned in ERP

Prerequisites: voidRepresentation of knowledge, inference and the process of proving theorems. Combinatorial Optimization Problems. Constraints, finite domain Constraint Satisfaction Problems (CSPs) and Boolean Satisfiability Problems (SAT). Search techniques including backtracking and its various improvements such as Backjuping, Backmarking. Intelligent backtracking. Propogation techniques including node, arc and k-consistencies. Global consistency. Forward checking. Hybrid algorithms. Repair based algorithms. Nogoods and clause learning during search algorithms. Partial Constraint Satisfaction Problems (PCSPs). Applications of CSPs.

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources