Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

The main part of CSP is the formulation of the problem, as the solution is
done automatically by searching in the entire domain. Improving the search
efficiency by employing heuristics may give a new flavor to the CSP.
Exercises
1. Draw a map of your country and shade the states carefully with a
minimum number of colors, so that no two neighbors have the same
color. Draw an equivalent constraint graph for the problem and hence
determine theoretically the minimum number of colors you require to
color the map.
2. Draw a passive electrical circuit with at least two loops, and then
construct the constraint net for your circuit. Instantiate the input variables
and show how the constraints propagate through the network to compute
the output variables.
3. Write three ineqalities, each of 3 variables, and solve them by the
approach presented in the chapter.
4. Draw a right angled pyramid with 4 planes and label its junctions: convex
or concave. Is there any uncertainty in your labeling? If yes, then how
will you resolve it?
References
[1] Cohen, J., “Constraint logic programming languages,” Communications
of the ACM, vol. 33, no. 7, pp. 52-68, 1990.
[2] Freuder, E. and Mackworth, A., Constraint Based Reasoning, MIT
Press, Cambridge, MA, 1994.
[3] Jaffer, J. and Maher, M., Constraint logic programming: A survey,
Journal of Logic Programming, vol. 19/20, pp. 503-582, 1994.
[4] Marriot, K. and Stuckey, P. J., Programming with constraints: An
introduction, MIT Press, Cambridge, MA, 1998.
[5] Stefik, M., Planning with constraints (MOLGEN: Part 1), Artificial
Intelligence, vol. 16, pp. 111-139, 1981.