1. Aspvall, B. and Shiloach, Y., “A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality,” in Proc. 20th ACM Symposium on Foundations of Computer Science, pp. 205-217, October 1979.
2. Braem, C., Le Charlier, B., Modart, S. and Van Hentenryck, P., “Cardinality analysis of prolog,” in Proc. International Symposium on Logic Programming, pp. 457-471, Ithaca, NY, MIT Press, November 1994.
3. Bueno, F., Deransart, P., Drabent, W., Ferrand, G., Hermenegildo, M., Maluszynski, J. and Puebla, G., “On the Role of Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs,” in Proc. of the 3rd. Int'l Workshop on Automated Debugging-AADEBUG 97, pp. 155-170, Linköping, Sweden, U. of Linköping Press, May 1997.
4. Dart, P.W. and Zobel, J., “A Regular Type Language for Logic Programs,” in Types in Logic Programming, pp. 157-187, MIT Press, 1992.
5. Dawson, S., Ramakrishnan, C. R., Ramakrishnan, I. V. and Sekar, R. C., “Extracting Determinacy in Logic Programs,” in 1993 International Conference on Logic Programming, pp. 424-438, MIT Press, June 1993.