Abstract
Several popular model-tracing tutors are available today, but they are usually limited by common general compromises, such as (1) between the complexity and the variety of the domains taught, or (2) between the precision of student modeling and the degree of easiness to model new domains. We present an improved version of the ASTUS formalism, allowing the modeling of more complex knowledge while simultaneously increasing the diversity of pedagogical behavior, with no loss in diversity or time consumption.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Anderson, J.R., Corbett, A.T., Koedinger, K.R., Pelletier, R.: Cognitive Tutors: Lessons Learned. The Journal of the Learning Sciences 4(2), 167–207 (1995)
Paquette, L., Lebeau, J.F., Mayers, A.: Authoring Problem-Solving Tutors: A Comparison Between ASTUS and CTAT. In: Nkambou, R., Bourdeau, J., Mizoguchi, R. (eds.) Advances in Intelligent Tutoring Systems, pp. 377–405. Springer, Heidelberg (2010)
VanLehn, K., et al.: Implicit versus explicit learning of strategies in a non-procedural cognitive skill. In: Lester, J.C., Vicari, R.M., Paraguaçu, F. (eds.) ITS 2004. LNCS, vol. 3220, pp. 521–530. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdessemed, A., Mayers, A. (2011). A Simple Method of Representing Reusable Strategic Knowledge for MT Tutoring. In: Biswas, G., Bull, S., Kay, J., Mitrovic, A. (eds) Artificial Intelligence in Education. AIED 2011. Lecture Notes in Computer Science(), vol 6738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21869-9_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-21869-9_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21868-2
Online ISBN: 978-3-642-21869-9
eBook Packages: Computer ScienceComputer Science (R0)