Automatic Problem Generation in Constraint-Based Tutors (2002)
Type of ContentConference Contributions - Published
PublisherUniversity of Canterbury. Computer Science and Software Engineering.
AuthorsMartin, B., Mitrovic, A.show all
EditorsCerri, S.; Gouarderes, G.; Paraguacu, F.
Constraint-Based Modelling (CBM) is a student modelling technique that is rapidly maturing. We have implemented several tutors using CBM and demonstrated its suitability to open-ended domains in particular. A problem with open-ended and complex domain models is their large size, necessitating a comprehensive problem set in order to provide sufficient exercises for extended learning sessions. We have addressed this issue by developing an algorithm that automatically generates new problems directly from the domain knowledge base. We present the algorithm and compare students’ performance with generated problems to those using a teacher-authored problem set, and show the performance of the generated problem set to be superior.
CitationMartin, B., Mitrovic, A. (2002) Automatic Problem Generation in Constraint-Based Tutors. Biarritz, France: 6th International Conference on Intelligent Tutoring Systems (ITS 2002), 2-7 Jun 2002. Lecture Notes in Computer Science, 2363, 388-398.
This citation is automatically generated and may be unreliable. Use as a guide only.