Forming student groups with student preferences using constraint logic programming

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Forming student groups must be carefully planned for a successful collaborative work. Since there is no consensus in the literature and in practice as to the strategy and parameters to use, a strategy that takes the teachers’ and the students’ perspectives was developed in this preliminary study. Furthermore, a program based on this strategy was also written using Constraint Logic Programming (CLP). The parameters and conditions to use were obtained through a faculty survey and student interviews. Based on the results, the faculty does not regard teammate preferences as important while students prefer that these are given the utmost consideration. Thus, cohorts produced are not only evaluated based on satisfied constraints but also on satisfied teammate preferences. Hence, the study demonstrates not only that CLP can be applied in the field of computer supported group formation but also that a grouping strategy can both include parameter constraints and teammate preferences.

Cite

CITATION STYLE

APA

Tacadao, G., & Toledo, R. P. (2016). Forming student groups with student preferences using constraint logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9883 LNAI, pp. 259–268). Springer Verlag. https://doi.org/10.1007/978-3-319-44748-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free