The constraint-based tutoring paradigm is feasible only for domains in which the solution itself is rich in information, whereas model tracing has no such restriction¶
Claim · All claims
Evidence · 1 study · designr?·q2
Currency · newest study 2005 · not yet checked against its sources · not reviewed by a person
Subclaims¶
Reading the evidence codes
q is the design tier, i the impact, n the sample, and the kind with its r
the rigour judged within that kind: what each code means.
This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.
q2 i? Building a constraint-based tutor was found feasible only when the solution itself is rich in information; model tracing carries no such domain restriction. → Viswanathan Kodaganallur 2005
Evidence¶
Viswanathan Kodaganallur 2005¶
Viswanathan Kodaganallur, Rob R. Weitz, David Rosenthal. (2005). A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms. International Journal of Artificial Intelligence in Education. https://telearn.hal.science/hal-00197305
q2 · i? · design · r?
The authors' comparative study of two tutors built for the same domain (statistical hypothesis testing) concluded this domain characteristic: "the constraint-based paradigm is feasible only for domains in which the solution itself is rich in information".
"the constraint-based paradigm is feasible only for domains in which the solution itself is rich in information. There is no such restriction for model tracing."
Discussion¶
Related Claims¶
- Two characteristics of the problem domain are key in distinguishing which tutoring paradigm is appropriate for a given domain — a broader claim this one bears on
- Building a model-tracing tutor requires greater development effort than building a constraint-based tutor for the same domain — related
Page metadata
| Field | Value |
|---|---|
type |
claim |
id |
constraint-based-tutoring-requires-information-rich-solutions |
title |
The constraint-based tutoring paradigm is feasible only for domains in which the solution itself is rich in information, whereas model tracing has no such restriction |
description |
The constraint-based tutoring paradigm is feasible only for domains in which the solution itself is rich in information, whereas model tracing has no such restriction |
status |
review |
evidence_strength |
weak |
newest_evidence |
2005 |
generated |
by process:wiki-ingest on 2026-10-27 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — viswanathan-kodaganallur-2005 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.