Abstract
One of the major components of an ITS is the tutor model. Its primary objective is instruction and remediation. This design is part of a full-blown ITS for Pascal and will focus on the design of the tutor models’ domain knowledge and a learning algorithm for its extension. This tutor model is comprised of a set of strategies in teaching basic Pascal programming, a knowledge base consisting of rules specifying the best strategy to utilize, and an algorithm that determines which teaching action (rule) to be deployed given the goals of the system and the current state of the student model. It is usually the case that the domain knowledge is incomplete, thus making the tutor model incapable of using the instructional method appropriate to the learner-user. It is therefore necessary for an effective ITS to embody a learning algorithm, for it to be able to modify its knowledge base through generalization, specialization, and the application of rule probability theory, thereby extending its domain knowledge.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reyes, R.L., Apostol, R., Kua, T., Mendoza, R., Tan, C.A. (1998). GURU: A Self-extending Tutor Model for Pascal Programming. In: Goettl, B.P., Halff, H.M., Redfield, C.L., Shute, V.J. (eds) Intelligent Tutoring Systems. ITS 1998. Lecture Notes in Computer Science, vol 1452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68716-5_87
Download citation
DOI: https://doi.org/10.1007/3-540-68716-5_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64770-6
Online ISBN: 978-3-540-68716-0
eBook Packages: Springer Book Archive