Artificial Intelligence

Consider a scheduling problem, where there are five 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 notequalto A, C > E, C notequalto D, B greaterthanorequalto A, B notequalto C, C notequalto D + 1. Draw the domain-consistent constraint network. Apply the are consistency algorithm to the CSP above. Show the steps in the table below. Show the values removed from the variables. Indicate the constraints considered for each step in the second column. Slate the solution obtained. Use the following diagram to draw your network