Reference no: EM132351

Question

Think a scheduling problem, where there are five activities to be scheduled in four time slots. assume we represent activities by the variables A, B, C, D, and E, where domain of each variable is {1,2,3,4} and constraints are A>D, D>E, C ≠A, C>E, C ≠D, B ≥ A, B≠C, and C≠D+1. (Before you start this, try to find the legal schedule(s) using your own intuition.)

Show how arc consistency can be used to solve this problem. To do this you have to-
1- depict constraint graph;
2- Show that elements of a domain are deleted at each step, and which arc is responsible for removing the element;
3- explain explicitly the constraint graph after arc consistency has stopped; and
4- illustrate how splitting a domain can be used to solve this problem.