Experiences in implementing constraint-based modeling in SQL-TUTOR

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

Abstract

The problem with most student modeling approaches is their insistence on complete and cognitively valid models of student’s knowledge. Ohlsson [10] proposes Constraint-Based Modeling (CBM) as a way to overcome intractability of student modeling, by generating models that are precise enough to guide instruction, and are computationally tractable at the same time. The paper presents our experiences in building SQL-Tutor, an ITS built upon CBM. CBM is extremely computationally efficient. State constraints, which form the basis of CBM, are very expressive; we have encountered no situations where constraints were unable to diagnose student answers. The time needed to acquire, implement and test a constraint is less than times reported for the acquisition of production rules. The initial evaluation of SQL-Tutor proved the validity of design and appropriateness of CBM.

Cite

CITATION STYLE

APA

Mitrović, A. (1998). Experiences in implementing constraint-based modeling in SQL-TUTOR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1452, pp. 414–423). Springer Verlag. https://doi.org/10.1007/3-540-68716-5_47

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