Question
Consider a scheduling problem, where there are 5 activities to be scheduled in four time slots. Suppose we represent the activities by the variables A, B, C, D, and E, where the domain of each variable is {1,2,3,4} and the constraints are A>D, D>E, C ≠A, C>E, C ≠D, B ≥ A, B≠C, and C≠D+1.
*B* explain how arc consistency can be used to solve this problem. To do this you must-
1- illustrate the constraint graph;
2- Show which elements of a domain are deleted at each step, and that arc is responsible for removing the element;
3- demonstrate explicitly the constraint graph after arc consistency has stopped; and
4- explain how splitting a domain can be used to solve this problem.