Abstract
We explore fundamental issues of the modeling, implementation, and processing of non-binary constraints. General techniques for reformulating non-binary constraints (i.e., hidden variable, dual graph [1]) are not practical for high-arity constraints [4]. In our study, we motivate our need to express practical requirements as non-binary constraints, then we explore reformulation methods to deal with them since the conventional methods [1] become impractical. Our work builds on the work of Gent et al. [2], while we motivate and anchor our investigations in the practical context of a real-world application. This is the assignment of graduate teaching assistants to courses in our department. This task is a critical responsibility that our department’s administration has to drudge through every semester. The idea for this particular application is borrowed from Rina Dechter, at the UC Irvine. We model this application using 4 types of unary constraints, one type of binary constraint, and 3 types of non-binary constraints. Since in our application problems are over-constrained, a satisfactory assignment is one that maximizes the number of courses covered. For this purpose, we adopt a new consistency checking mechanism that allows variables to be assigned a null value during search. For two assignments that cover the same number of courses, we further discriminate between them by choosing the one of highest quality, obtained by a combination of the value of the preferences in each assignment. We experiment with two different criteria to maximize preferences. We establish that two of our non-binary constraints are decomposable into equivalent networks of binary constraints, which significantly improves the performance of search [3]. Our efforts have resulted in a prototype system under field-test since August 2001. This system has effectively reduced the number of conflicts, thus yielding a commensurate increase in course quality. It has also decreased the amount of time and effort spent on making the assignment and gained the approval and satisfaction of our staff, faculty and student body.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In AAAI/IAAI, pages 310–318, 1998.
I. P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. In New Trends in Constraints, pages 134–149, 1999.
R. Glaubius and B. Y. Choueiry. Constraint Constraint Modeling and Reformulation in the Context of Academic Task Assignment. In Working Notes of the Workshop Modelling and Solving Problems with Constraints, ECAI 2002, Lyon, France, 2002.
J-C. Régin. Usenet message posted on comp.constraints, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glaubius, R., Choueiry, B.Y. (2002). Constraint Modeling in the Context of Academic Task Assignment. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_82
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive