Question

You are in charge of scheduling for computer science classes that meet MWE. There are 5 classes that meet on these days and 3 professors who will be teaching these classes. You are constrained by the fact that each professor can only teach one class at a time. SE The classes are: • Class 1. Intro to Programming meets from 8:00-9:00am Class 2 - Intro to Artificial Intelligence: meets from 8:00-9:00am Class 3 - Natural Language Processing: meets from 9:30-10:30am • Class 4 - Computer Vision: meets from 9:00-10:00am Class 5 - Machine Learning: meets from 8:30-9:30am EZ The professors are: Professor A, who can teach Classes 1, 3 and 4. • Professor B, who can teach Classes 2, 3, 4, and 5. Professor C, who can teach Classes 1,2,3,4,5. Www Answer the following questions a) Formulate this problem as a CSP: specify the variables, their initial domains, and the constraints. b) Draw the constraint graph associated with this CSP Show the domains of the variables after running arc-consistency on this initial graph (after having already enforced any unary constraints). d) Give one solution to this CSP.

Answer 1

variables Domains (or Unary constraints ن مل کر ا ا A c3 B، A,B,C3 } A, B, c} 6.3 ان) یک